爱吃的代码渣渣许愿简历通过

分类

/ 注册

全部文章（共69篇）

题解 | BFS

s = str(input()) count = -1 for i in range(len(s) - 2): k = s[i : i + 3] if k.lower() == "bob": count = i break p...

2025-12-28

0 16

题解 | 添加逗号

number = input() numberlist = str(number)[::-1] qianfenwei = [] for i in range(len(numberlist)): if i % 3 == 0 and i != 0: qianfenwei.a...

2025-12-21

0 19

题解 | 斗兽棋

s1, s2 = map(str, input().split()) rlues = {"elephant":"tiger", "tiger":"cat", "cat":"...

2025-12-21

0 14

题解 | 年轻人不讲5的

char = input() print(char.replace('5', '*'))

2025-12-21

0 14

题解 | 扫雷

n, m = map(int, input().split()) a = [[0 for _ in range(m)] for _ in range(n)] b = [[None for _ in range(m)] for _ in range(n)] driections = [(-1, ...

2025-12-21

0 18

题解 | 杨辉三角

n = int(input()) a = [1] if n >= 2: for i in range(1, n+1): b = [1 for _ in range(i)] for j in range(1, len(b)-1): ...

2025-12-20

0 13

题解 | 矩阵转置

n, m = map(int, input().split()) a = [[0 for _ in range(n)] for _ in range(m)] for i in range(n): b = list(map(int, input().split())) for j ...

2025-12-20

0 12

题解 | 上三角矩阵判定

n = int(input()) count = 0 for i in range(n): a = list(map(int, input().split())) for j in range(i): if a[j] != 0: count...

2025-12-19

0 13

题解 | 单组_二维数组

n, m = map(int, input().split()) count = 0 for i in range(n): a = list(map(int, input().split())) count += sum(a) print(count)

2025-12-19

0 14

题解 | 校门外的树

l, m = map(int, input().split()) shu = [1] * (l + 1) for x in range(m): l, i = map(int, input().split()) shu[l:i+1] = [0] * (i - l + 1) ...

2025-12-19

0 19