暴力枚举
纯暴力dfs
用字符串存储
python3 代码
import sys
m,n,k = map(int, input().split())
mat = []
rec = []
for line in sys.stdin:
mat.append(list(map(int, line.split())))
def dfs(i,j,k):
if k == 0:
return [str(mat[i][j])]
ans = []
for dx,dy in [(-1,0),(1,0),(0,1),(0,-1)]:
ii = i+ dx
jj = j+ dy
if 0<=ii<m and 0<=jj<n:
for a in dfs(ii,jj,k-1):
ans.append(str(mat[i][j])+a)
return ans
for i in range(m):
for j in range(n):
#bfs
rec += dfs(i,j,k)
print(len(list(set(rec))))