解题思路:
注意事项:
参考代码:
def dfs(x=0, y=0, add_all=0): global map_, visited, around, sum_, res, end_flag if add_all == sum_ // 2: end_flag = 1 return if not visited[x][y]: visited[x][y] = True add_all += map_[x][y] res += 1 for i in around: if 0 <= i[0] + x < n and 0 <= i[1] + y < m: dfs(i[0] + x, i[1] + y, add_all) if end_flag: return visited[x][y] = False res -= 1 add_all -= map_[x][y] m, n = map(int, input().split()) map_ = [list(map(int, input().split()))[:m] for _ in range(n)] visited = [[False for _ in range(m)] for _ in range(n)] around = [[1, 0], [0, 1], [-1, 0], [0, -1]] sum_, res, end_flag = sum(sum(i) for i in map_), 0, 0 dfs() print(res)
0.0分
1 人评分
C二级辅导-计负均正 (C++代码)浏览:898 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:596 |
【明明的随机数】 (C++代码)(C++库中有qsort函数直接快排,不用码排序代码hhh)浏览:976 |
点我有惊喜!你懂得!浏览:2707 |
母牛的故事 (C语言代码)浏览:671 |
C语言程序设计教程(第三版)课后习题1.6 (C语言代码)浏览:584 |
C语言训练-大、小写问题 (C语言代码)浏览:2356 |
C语言程序设计教程(第三版)课后习题9.8 (Java代码)浏览:1640 |
2003年秋浙江省计算机等级考试二级C 编程题(1) (C语言代码)浏览:604 |
字符逆序 (C语言代码)浏览:615 |