Largest product in a grid: Difference between revisions

{{trans|Python}}

 

‘ find the largest product of len length horizontal or vertical length in matrix ’

V (nrow, ncol) = (mat.len, mat[0].len)

 

L(n) 2..5

 

{{out}}

 

=={{header|ALGOL 68}}==

[,]INT m = ( ( 08, 02, 22, 97, 38, 15, 00, 40, 00, 75, 04, 05, 07, 78, 52, 12, 50, 77, 91, 08 )

, ( 49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 04, 56, 62, 00 )

)

)

{{out}}

<pre>

 

=={{header|AutoHotkey}}==

(

08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08

}

}

{{out}}

<pre>Max Product = 51267216

66*91*88*97 @ Row 7 - Row 10, Col 16</pre>

=={{header|AWK}}==

# syntax: GAWK -f LARGEST_PRODUCT_IN_A_GRID.AWK

BEGIN {

exit(0)

}

{{out}}

<pre>

 

=={{header|F_Sharp|F#}}==

// Largest product in a grid. Nigel Galloway: December 30th., 2021

let N=[|8; 2;22;97;38;15; 0;40; 0;75; 4; 5; 7;78;52;12;50;77;91; 8;

 

printfn "%d" (seq{for n in 0..19 do for g in 0..16 do let n=n*20 in yield N.[n+g]*N.[n+g+1]*N.[n+g+2]*N.[n+g+3]; for n in 0..19 do for g in 0..16 do let g=g*20 in yield N.[n+g]*N.[n+g+20]*N.[n+g+40]*N.[n+g+60]}|>Seq.max)

{{out}}

<pre>

=={{header|Factor}}==

{{works with|Factor|0.99 2021-06-02}}

sequences ;

 

} 20 group

 

{{out}}

<pre>

 

=={{header|FreeBASIC}}==

data 49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48,04,56,62,00

data 81,49,31,73,55,79,14,29,93,71,40,67,53,88,30,03,49,13,36,65

 

print "The largest product was ";champ;" at row ";cr;" and column ";cc;", reading ";

{{out}}<pre>The largest product was 51267216 at row 7 and column 16, reading down.</pre>

 

{{trans|Wren}}

{{libheader|Go-rcu}}

 

import (

}

fmt.Println()

 

{{out}}

=={{header|Julia}}==

First, a quick method, which does not reveal the product locations:

08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08

49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00

maximum([prod(mat[i:i+3, j]) for i in 1:17, j in 1:20]))

println("The maximum product of 4 adjacent horizontal or vertical in the matrix is: $x")

<pre>The maximum product of 4 adjacent horizontal or vertical in the matrix is: 51267216</pre>

Alternatively, to get the position of the maximum product:

nrow, ncol = size(mat)

maxprod, maxrow, maxcol, arr = 0, 0:0, 0:0, [0]

 

maxprod(mat, 4)

<pre>The maximum product is 51267216, product of [66, 91, 88, 97] at row 7:10, col 16:16</pre>

=={{header|Mathematica}} / {{header|Wolfram Language}}==

{08, 02, 22, 97, 38, 15, 00, 40, 00, 75, 04, 05, 07, 78, 52, 12,

50, 77, 91, 08},

maxProduct[x_List, n_] := Max[Times @@@ Partition[x, n, 1]]

Max@Join[maxProduct[#, 4] & /@ array,

 

{{out}}<pre>51267216</pre>

 

=={{header|ooRexx}}==

a.1=.array~of(08,02,22,97,38,15,00,40,00,75,04,05,07,78,52,12,50,77,91,08)

a.2=.array~of(49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48,04,56,62,00)

Parse Var rc row col

Say 'Maximum in column' col 'rows' row '...' (row+3)

{{out}}<pre>Maximum in row 9 columns 11 ... 14 : 78*78*96*83=48477312

Maximum in column 16 rows 7 ... 10 : 66*91*88*97=51267216</pre>

 

=={{header|Perl}}==

 

use strict; # https://rosettacode.org/wiki/Largest_product_in_a_grid

while /(?=(\d\d)$gap(\d\d)$gap(\d\d)$gap(\d\d))/g;

}

{{out}}

<pre>

=== Generalized ===

Handles non-square input (both narrow and wide).

use warnings;

use feature 'say';

}

 

{{out}}

<pre>Largest product of 1 adjacent elements: 99

 

=={{header|Phix}}==

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">function</span> <span style="color: #000000;">splint</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: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"The largest product of length %d is %,d in %s starting at %d,%d\n"</span><span style="color: #0000FF;">,</span><span style="color: #000000;">i</span><span style="color: #0000FF;">&</span><span style="color: #000000;">gridmax</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>

{{out}}

<pre>

=={{header|Python}}==

{{trans|Julia}}

 

from math import prod

for n in range(2, 6):

maxproduct(MATRIX, n)

<pre>

The max 2-product is 9215, product of [95, 97] at row [7, 9], col 8.

=={{header|Raku}}==

General solution. No hard coded values. Works with any size matrix, configurable number of terms.

08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08

49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00

@matrix.rotor($terms => -$terms+1).flat»[$_].batch($terms)».reduce(&[*]), # vertical

@matrix[$_].rotor($terms => -$terms+1)».reduce(&[*]); # horizontal

{{out}}

<pre>Largest product of 4 adjacent elements: 51267216</pre>

 

=={{header|REXX}}==

Call mk_a 1,08,02,22,97,38,15,00,40,00,75,04,05,07,78,52,12,50,77,91,08

Call mk_a 2,49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48,04,56,62,00

a.row.col=arg(col+1)

End

{{out}}<pre> Maximum in row 9 columns 11 ... 14 : 78*78*96*83=48477312

Maximum in column 16 rows 7 ... 10 : 66*91*88*97=51267216</pre>

 

=={{header|Ring}}==

see "working..." + nl

see "Largest product is:" + nl

 

see nl + "done..." + nl

{{out}}

<pre>

 

=={{header|Sidef}}==

08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08

49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00

var nums = products.max_by { .prod }

say "Largest product of #{N} adjacent elements: prod(#{nums}) = #{nums.prod}"

{{out}}

<pre>

=={{header|Wren}}==

{{libheader|Wren-fmt}}

 

var grid = [

for (c in maxC1..maxC2) Fmt.write("($d, $d) ", r+1, c+1)

}

 

{{out}}

 

=={{header|XPL0}}==

[Grid:=[[08,02,22,97,38,15,00,40,00,75,04,05,07,78,52,12,50,77,91,08],

[49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48,04,56,62,00],

];

IntOut(0, Max);

 

{{out}}