给定两个非空非负整数矩阵甲和乙，回答的次数甲出现作为连续的，可能重叠，子矩阵在乙。
答：
[[3,1],
[1,4]]
B：
[[1,4],
[3,1]]
回答：
0
答：
[[1,4],
[3,1]]
B：
[[3,1,4,0,5],
[6,3,1,0,4],
[5,6,3,0,1]]
答：（
1以粗体显示）
答：
[[1,4],
[3,1]]
B：
[[3,1,4,5],
[6,3,1,4],
[5,6,3,1]]
答：（
2分别以粗体和斜体标出）
答：
[[3]]
B：
[[3,1,4,5],
[6,3,1,4],
[5,6,3,1]]
答：（
3以粗体显示）
答：
[[3,1,3]]
[[3,1,3,1,3,1,3,1,3]]
答：（
4两个粗体，两个斜体）
Answers:
{{s\s\}ᵈ}ᶜ
我喜欢Brachylog中该程序的清晰明了；不幸的是，它不是那么短的字节长度，因为元谓词语法占用三个字节，并且在该程序中必须使用两次。
{{s\s\}ᵈ}ᶜ
s Contiguous subset of rows
\s\ Contiguous subset of columns (i.e. transpose, subset rows, transpose)
{ }ᵈ The operation above transforms the first input to the second input
{ }ᶜ Count the number of ways in which this is possible
ZẆ$⁺€Ẏċ
ZẆ$⁺€Ẏċ Main link. Arguments: B, A
$ Combine the two links to the left into a monadic chain.
Z Zip; transpose the matrix.
Ẇ Window; yield all contiguous subarrays of rows.
⁺ Duplicate the previous link chain.
€ Map it over the result of applying it to B.
This generates all contiguous submatrices of B, grouped by the selected
columns of B.
Ẏ Tighten; dump all generated submatrices in a single array.
ċ Count the occurrences of A.
ZyYC2MX:=XAs
输入是甲，然后乙。
考虑输入[1,4; 3 1]，[3,1,4,5; 6,3,1,4; 5,6,3,1]。堆栈显示在下面，带有最新元素。
Zy % Implicit input: A. Push size as a vector of two numbers
% STACK: [2 2]
YC % Implicit input: B. Arrange sliding blocks of specified size as columns,
% in column-major order
% STACK: [3 6 1 3 4 1;
6 5 3 6 1 3;
1 3 4 1 5 4;
3 6 1 3 4 1]
2M % Push input to second to last function again; that is, A
% STACK: [3 6 1 3 4 1;
6 5 3 6 1 3;
1 3 4 1 5 4;
3 6 1 3 4 1],
[1 4;
3 1]
X: % Linearize to a column vector, in column-major order
% STACK: [3 6 1 3 4 1;
6 5 3 6 1 3;
1 3 4 1 5 4;
3 6 1 3 4 1],
[1;
3;
4;
1]
= % Test for equality, element-wise with broadcast
% STACK: [0 0 1 0 0 1
0 0 1 0 0 1;
0 0 1 0 0 1;
0 0 1 0 0 1]
XA % True for columns containing all true values
% STACK: [0 0 1 0 0 1]
s % Sum. Implicit display
% STACK: 2
øŒεøŒI.¢}O
øŒεøŒI.¢}O Full program. Takes 2 matrices as input. First B, then A.
øŒ For each column of B, take all its sublists.
ε } And map a function through all those lists of sublists.
øŒ Transpose the list and again generate all its sublists.
This essentially computes all sub-matrices of B.
I.¢ In the current collection of sub-matrices, count the occurrences of A.
O At the end of the loop sum the results.
≢∘⍸⍷
⍷ Binary matrix containing locations of left argument in right argument
≢∘⍸ Size of the array of indices of 1s
可选的非内置的：
{+/,((*⍺)≡⊢)⌺(⍴⍺)*⍵}
双向函数，将大数组放在右侧，子数组放在左侧。
*⍵ exp(⍵), to make ⍵ positive.
((*⍺)≡⊢)⌺(⍴⍺) Stencil;
all subarrays of ⍵ (plus some partial subarrays
containing 0, which we can ignore)
⍴⍺ of same shape as ⍺
(*⍺)≡⊢ processed by checking whether they're equal to exp(⍺).
Result is a matrix of 0/1.
, Flatten
+/ Sum.
在这里尝试。
∘），以缩短列车：+/∘∊⍷甚至≢∘⍸⍷
ＩΣ⭆η⭆ι⁼θＥ✂ηκ⁺Ｌθκ¹✂νμ⁺Ｌ§θ⁰μ¹
在线尝试！现在，Equals再次可用于数组，但要短得多。说明：
η Input array B
⭆ Mapped over rows and joined
ι Current row
⭆ Mapped over columns and joined
θ Input array A
⁼ Is equal to
η Input array B
✂ Sliced
¹ All elements from
κ Current row index to
Ｌ Length of
θ Input array A
⁺ Plus
κ Current row index
Ｅ Mapped over rows
ν Current inner row
✂ Sliced
¹ All elements from
μ Current column index to
Ｌ Length of
θ Input array A
§ Indexed by
⁰ Literal 0
⁺ Plus
μ Current column index
Σ Digital sum
Ｉ Cast to string
Implicitly printed
a,b=input()
l,w,L,W,c=len(a),len(a[0]),len(b),len(b[0]),0
for i in range(L):
for j in range(W):
if j<=W-w and i<=L-l:
if not sum([a[x][y]!=b[i+x][j+y]for x in range(l)for y in range(w)]):
c+=1
print c 非常坦率的。逐步浏览较大的矩阵，然后检查较小的矩阵是否适合。
唯一甚至有些棘手的步骤是第6行中的列表理解，它依赖于Python混合布尔和整数算术的约定。
⍷