python--study||O.o
摘要：参考代码:column = int(input())
s = input()
row = len(s) // column
arr = [list(s[i * column: (i + 1) *……
题解列表
python--study||O.o
摘要：参考代码:dx = (-1, 0, 1, 0)
dy = (0, -1, 0, 1)
def judge(x, y):
if x == 0 or x == n - 1 or y ……
编写题解 1138: C语言训练-求矩阵的两对角线上的元素之和
摘要：解题思路:注意事项:参考代码:n = int(input())
arr = [list(map(int, input().split())) for _ in range(n)]
x, y = 0……
1024: [编程入门]矩阵对角线求和
摘要：解题思路:注意事项:参考代码:arr = [list(map(int, input().split())) for _ in range(3)]
x, y = 0, 0
for i in rang……
python--study||O.o
摘要： 就是求内部矩形的大小，主要问题是根据题意判断起点和终点参考代码:#肿瘤与边缘之间必须被0分隔开（未完全分隔就不算答案）
n = int(input())
arr = [list(m……
python--study||O.o
摘要：参考代码:#每个草丛只能是1个'#'或2个'#'
dx = (-1, 0, 1, 0)
dy = (0, -1, 0, 1)
def f(x, y):
……
python--study||O.o
摘要：参考代码:from copy import deepcopy
dx = (-1, 0, 1, 0)
dy = (0, -1, 0, 1)
def judge(x, y):
fo……
python--study||O.o
摘要：参考代码:arr = [[0] * 9 for _ in range(9)]
temp = [[0] * 9 for _ in range(9)]#辅助列表，接收变化后的数据
dx = (-1,0……
python--study||O.o
摘要：参考代码:dx = (-1,0,1,0,-1,-1,1,1)
dy = (0,-1,0,1,-1,1,-1,1)
n, m = map(int, input().split())
map = [……
python--study||O.o
摘要：参考代码:n, m = map(int, input().split())
arr = [[int(num) for num in input().split()] for _ in range(n……