'matrix' New Answers

1

Drop some boxes

Ruby, 73 bytes ->l{l.permutation.map{|x|x*=?_;1while x.sub!(/(.*)_\1/,'\1');x.size}.min} Try it online! Assuming I can accept a list of columns in input Ruby, 108 bytes ->l{l.map(&:chars).transpose.map(&:join).permutation.map{|x|x*=?_;1while x.sub!(/(.*)_\1/,'\1');x.size}.min} Try it online! Otherwise

answered 2 days ago

G B

13.5k1 gold badge16 silver badges41 bronze badges

4

Drop some boxes

Jelly, 24 bytes ZWṖ€ṛ¦Ɱ0ịⱮĠƊ$€Ẏ$Ẹ€Ạ$Ð¿L’ Try it online! A monadic link taking a list of Jelly strings (a list of lists of characters) and returning an integer. Explanation Z | Transpose W | Wrap in a list $Ð¿ | While the following is true: Ẹ€ | - Any list is non-empty ...

code-golf string matrix

answered Jun 20 at 19:03

Nick Kennedy

14.4k2 gold badges12 silver badges32 bronze badges

1

Drop some boxes

J, 55 bytes (1+[:<./$:"1)@((]}.~1{.=)&.>"0/~' '-.~{.&>)`0:@.(''-:;) Try it online! Brute force recursion taking away boxes until none are left, and returning the minimum number of steps.

code-golf string matrix

answered Jun 20 at 16:25

Jonah

20.2k4 gold badges23 silver badges58 bronze badges

8

Drop some boxes

Pyth, 22 bytes L&lbhSmhyfT>RqhkhdbbyC Try it online! Or run all test cases at once. This is basically ovs's Python solution translated verbatim to Pyth (it seems that their solution's exact algorithm is also shortest in Pyth), so I'm posting it as community wiki. Doesn't time out thanks to Pyth's memoization.

code-golf string matrix

community wiki

PurkkaKoodari

5

Drop some boxes

Brachylog, 31 bytes ∧≜.&z{{⟨k≡t⟩|;X}ᵐRtᵛ∧Rhᵐ}ⁱ↖.zĖ∧ Try it online! It's a bit less efficient than even the other two answers so far (it does the classic recompute everything if it hasn't reached the end in as many steps as it's trying), so I might just delete this when I wake up if it still hasn't spit something out for the second-to-last test case.

code-golf string matrix

answered Jun 20 at 12:26

Unrelated String

10.7k2 gold badges13 silver badges37 bronze badges

9

Drop some boxes

Python 2, 103 91 bytes -12 bytes thanks to PurkkaKoodari! lambda s:f(zip(*s)) f=lambda s:len(s)and-~min(f({r[r[0]==x[0]:]for r in s}-{()})for x in s) Try it online! The last testcase times out. The first function just transposes the input, if we can take input as a list of columns it can be omitted.

code-golf string matrix

answered Jun 20 at 11:51

ovs

38.7k2 gold badges20 silver badges105 bronze badges

8

Drop some boxes

Charcoal, 57 bytes ＷＳ⊞υι≔⟦Ｅθ⮌⭆υ§λκ⟧η≔⁰ζＷ⌊η«≦⊕ζ≔ηθ≔⟦⟧ηＦθＦκ⊞ηΦＥκΦμ∨π¬⁼ξ§λ⁰μ»Ｉζ Try it online! Link is to verbose version of code. Uses brute force so too slow for the last test case on TIO. Explanation: ＷＳ⊞υι Input the pile. ≔⟦Ｅθ⮌⭆υ§λκ⟧η Rotate the pile by 90° and put it into a list. ≔⁰ζ Start counting the number of steps. Ｗ⌊η« Repeat until there is at ...

code-golf string matrix

answered Jun 20 at 11:03

Neil

125k9 gold badges57 silver badges234 bronze badges

1

Ordinary Least Squares Regression

Julia 1.0, 30 bytes Adapted from @flawr !x=[(t=x[1]).^0 x[2:end]...]\t Try it online!

code-golf matrix statistics

answered Jun 17 at 16:38

mapi1

814 bronze badges

1

Square chunk my matrix

K (ngn/k), 29 bytes {(*>#'=,/)''2((0N;y)#/:+:)/x} Try it online! Based off of @Shaggy's Japt answer. Takes the input matrix as x and the chunk size as y. 2(...)/x set up a do-reduce, seeded with x and run twice ((0N;y)#/:+:) transpose the input, then slice each row into y-length chunks (...)'' run the code in (...) on each chunk in the transformed ...

code-golf matrix set-partitions statistics

answered Jun 17 at 14:54

coltim

3,6081 silver badge7 bronze badges

1

Square chunk my matrix

Wolfram Language (Mathematica), 41 bytes BlockMap[Commonest[Join@@#,1]&,#2,{#,#}]& Try it online! Input [n, m]. Returns a matrix of singleton lists.

code-golf matrix set-partitions statistics

answered Jun 16 at 22:17

att

9,7991 gold badge7 silver badges30 bronze badges

0

Square chunk my matrix

Charcoal, 54 bytes Ｆ⪪Ｅθ⪪ιηη«≔⟦⟧ζＦＬ§ι⁰«≔⟦⟧εＦι≔⁺ε§λκε≔Ｅε№ελδ⊞ζ§ε⌕δ⌈δ»⊞υζ»Ｉυ Try it online! Link is to verbose version of code. Explanation: Ｆ⪪Ｅθ⪪ιηη« Split each column into chunks of size n, then split the rows into chunks of size n and loop over the chunks. ≔⟦⟧ζ Start collecting the results for this chunk of rows. ＦＬ§ι⁰« Loop over the number of chunks of ...

code-golf matrix set-partitions statistics

answered Jun 16 at 22:07

Neil

125k9 gold badges57 silver badges234 bronze badges

2

Square chunk my matrix

R, 130 124 121 116 111 bytes -5 bytes and another 3 thanks to @Dominic function(M,n,k=dim(M))array(Map(function(x)el(names(sort(-table(x))):0),split(M,t(a<-(row(M)-1)%/%n)*k+a)),k/n) Try it online! Longer approach than @Dominic's, but I thought it's worth a try. Builds matrix mask t(a<-(row(M)-1)%/%n)*dim(M)+a used then in split, for example for ...

code-golf matrix set-partitions statistics

answered Jun 16 at 20:00

pajonk

3,9821 gold badge13 silver badges29 bronze badges

0

Square chunk my matrix

Python 3.8 (pre-release), 96 bytes Takes as input an integer matrix \$ m \$, and an integer \$ n \$ denoting the chunk size. lambda m,n:[[max(x:=sum(j,()),key=x.count)for j in zip(*[zip(*i)]*n)]for i in zip(*[iter(m)]*n)] Try it online! Very messy use of the split into chunks golfing tip.

code-golf matrix set-partitions statistics

answered Jun 16 at 18:58

dingledooper

11.2k1 gold badge12 silver badges65 bronze badges

1

Square chunk my matrix

Python 2, 174 bytes Quite long, very ugly, possibly the most comprehensions I've used in one statement. There is undoubtedly a better way to do this but I can't look at this thing anymore. def f(m,n):l=len(m);r=range(0,l,n);b=l/n;print('%s '*b+'\n')*b%tuple(max(v,key=v.count)for v in[sum([x[k][j:j+n]for k in range(n)],[])for x in[m[i:i+n]for i in r]for j in ...

code-golf matrix set-partitions statistics

answered Jun 16 at 18:27

kur0dama

314 bronze badges

2

Square chunk my matrix

Jelly, 12 bytes sZ€FÆṃḢƊ⁹ÐƤ€ Try it online! After several 13s, I found a 12. A dyadic link taking the grid as a list of lists of integers on the left side and the size of the split on the right. Explanation s | Split into sublists of the length specified by the right argument Z€ | Transpose each Ɗ⁹ÐƤ€ | For each sublist, do the ...

code-golf matrix set-partitions statistics

answered Jun 16 at 18:22

Nick Kennedy

14.4k2 gold badges12 silver badges32 bronze badges

1

Square chunk my matrix

R, 113 111 108 bytes Edit: -2 bytes, and then -3 more bytes, thanks to pajonk (or 105 bytes by outputting a matrix of text strings representing the integers) function(m,n)outer(o<-0:(nrow(m)/n-1)*n,o,Vectorize(function(x,y)el(names(sort(-table(m[x+1:n,y+1:n]))):0))) Try it online!

code-golf matrix set-partitions statistics

answered Jun 16 at 14:57

Dominic van Essen

13.7k2 gold badges7 silver badges27 bronze badges

1

Square chunk my matrix

JavaScript (ES6), 136 135 bytes Expects (matrix)(chunk_size). m=>n=>m.slice(-m.length/n).map((_,y,a)=>a.map((_,x)=>eval("for(o=K={},i=n*n;i--;)(o[v=m[y*n+i/n|0][x*n+i%n]]=-~o[v])<K?0:K=o[V=v];V"))) Try it online! Commented This is a version without eval() for readability. m => n => // m[] = matrix; n = ...

code-golf matrix set-partitions statistics

answered Jun 16 at 12:31

Arnauld

153k14 gold badges153 silver badges552 bronze badges

0

Square chunk my matrix

JavaScript (Node.js), 159 bytes n=>k=>n.flatMap((e,i)=>i%k?[]:e.flatMap((h,j)=>j%k?[]:(M=n.slice(i,i+k).map(K=>K.slice(j,j+k)).flat()).sort((a,b)=>(X=Y=>M.map(Z=>z+=Z==Y,z=0)|z)(b)-X(a))[0])) Try it online! Golfing languages which have built-ins for occurrence count or chunks have concise programs. Mine is 159 bytes long.

code-golf matrix set-partitions statistics

answered Jun 16 at 12:27

Recursive Co.

2,3361 gold badge4 silver badges31 bronze badges

3

Square chunk my matrix

Japt -h, 17 bytes 2Æ=yòV)ËËc ü ñÊÌÌ Try it 2Æ=yòV)ËËc ü ñÊÌÌ :Implicit input of 2D-array U and integer V 2Æ :Map the range [0,2) = :Reassign to U y : Transpose òV : Partition rows to length V ) :End reassignment Ë :Map Ë ...

code-golf matrix set-partitions statistics

answered Jun 16 at 12:06

Shaggy

31.8k3 gold badges26 silver badges83 bronze badges

1

Square chunk my matrix

APL (Dyalog Extended), 37 (SBCS) Anonymous tacit infix function taking chunk count as right argument and the input matrix as right argument. ((∪⊃⍨∘⊃∘⍒⊢∘≢⌸)∘,⍤2)1 3 2 4⍉⊣⍴⍨4⍴⊢,≢⍛÷ Try it online! {…} dfn; ⍺ is matrix and ⍵ is chunk size: ⎡0,1,0,1⎤ ⎢0,0,1,1⎥ ⎢0,0,0,0⎥ ⎣0,0,1,1⎦ and 2 ≢⍛÷ the matrix size divided by the chunk size 2 ⊢, prepend ...

code-golf matrix set-partitions statistics

answered Jun 16 at 11:56

Adám

24.5k2 gold badges105 silver badges266 bronze badges

4

Square chunk my matrix

J, 23 bytes (0{~.\:1#.=)@,;.3~2 2&$ Try it online! J's u;.3 is pretty handy for this. It splits a matrix into rectangles. You just need to give the size of the rectangles and the offset between rectangles. So for 3x3-tiles the input would be [[3 3],[3 3]]. That is handled by 2 2&$ (if we can take width and height of a tile as input, that would be ;.~...

code-golf matrix set-partitions statistics

answered Jun 16 at 11:56

xash

9,1311 gold badge11 silver badges31 bronze badges

2

Square chunk my matrix

MATL, 11 bytes thZCtvXM[]e Try it online! Or verify all test cases. How it works th % Implicit input: number n. Horizontally concatenate with itself to give [n n] ZC % Implicit input: matrix m. Im2col: arrange each [n n] block as a column of % length n*n tv % Vertically concatenate with itself. This makes columns twice as long without ...

code-golf matrix set-partitions statistics

answered Jun 16 at 11:51

Luis Mendo

95.6k9 gold badges113 silver badges338 bronze badges

5

Square chunk my matrix

APL (Dyalog Unicode), 40 38 bytes (SBCS) Anonymous tacit infix function taking chunk size as left argument and the input matrix as right argument. {(∪⊃⍨∘⊃∘⍒⊢∘≢⌸)∘,¨↑(⊂⊂¨⊂[1]∘⍵)(≢⍵)⍴⍺↑1} Try it online! {…} dfn; ⍺ is chunk size and ⍵ is matrix: 2 and ⎡0,1,0,1⎤ ⎢0,0,1,1⎥ ⎢0,0,0,0⎥ ⎣0,0,1,1⎦ ⍺↑1 take "chunk size" elements from 1, padding ...

code-golf matrix set-partitions statistics

answered Jun 16 at 11:33

Adám

24.5k2 gold badges105 silver badges266 bronze badges

2

Square chunk my matrix

Jelly, 13 bytes Zs€Zs€ẎF€ÆṃḢ€ Try it online! How it works Zs€Zs€ẎF€ÆṃḢ€ - Main link. Takes M on the left and n on the right Z - Transpose M s€ - Slice each row into n pieces Z - Transpose s€ - Split each group of columns into n pieces Ẏ - Flatten into a list of n x n matrices F€ - Flatten ...

code-golf matrix set-partitions statistics

answered Jun 16 at 11:28

caird coinheringaahing

38.8k9 gold badges83 silver badges254 bronze badges

1

Output a Latin Square

Risky, 21 bytes 00?+0*_?-1/_?-1+_0+02-0?+0+_]+]+_]+]+_]+] Try it online!

code-golf array-manipulation matrix

answered Jun 14 at 19:07

xigoi

4,1811 gold badge4 silver badges16 bronze badges

2

Is it a valid Parker Square

Python 3.8 (pre-release), 154 144 bytes lambda a:1-any([len({*a})>8,{(s:={sum(a[i%7:i%5*3:i%4])-a[4]for i in b"\r@@@+?"}).pop()}-{a[0]+a[8],a[2]+a[6]},s,sum(i<0 or i**.5%1for i in a)]) @ represents unprintables chars Outputs 1 for Parker, 0 for not Parker Try it online! A pretty messy solution ^^ How it works: 1-any([...]) will return 1 if all ...

code-golf math decision-problem grid matrix

answered Jun 14 at 0:52

Jakque

6902 silver badges7 bronze badges

1

Tag Info

New answers tagged matrix

Related Tags