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

分类

/ 注册

全部文章（共81篇）

题解 | 单组_二维数组

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 22

题解 | 校门外的树

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 35

题解 | 记数问题

n, x = map(int, input().split()) count = 0 for i in range(1, n+1): count += str(i).count(str(x)) print(count)

2025-12-18

0 30

题解 | 数组计数维护

t = int(input()) for i in range(t): n, k = map(int, input().split()) a = list(map(int, input().split())) s = cnt = 0 for j in range(n...

2025-12-18

0 27

题解 | 牛牛的数学作业

t = int(input()) for i in range(t): n = int(input()) a = list(map(int, input().split())) x = max(a) - min(a) c = sum(a) / n vsum ...

2025-12-18

0 25

题解 | 左侧严格小于计数

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

2025-12-18

0 29

题解 | 神秘石像的镜像序列

a = list(map(int, input().split())) a = a[::-1] for i in range(1, len(a)): print(a[i], end=" ")

2025-12-18

0 25

题解 | 二维斐波那契数列

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

2025-12-18

0 24

题解 | 牛牛学数列6

n = int(input()) a = [0] * 21 a[1] = 0 a[2:4] = 1, 1 if n >= 4: for i in range(4, n+1): a[i] = a[i-1] + 2 * a[i-2] + a[i-3] pr...

2025-12-17

0 25

题解 | 牛牛学数列6

n = int(input()) a1 = 0 a2, a3 = 1, 1 if n == 1: print(a1) elif n <= 3: print(a2) else: a = 0 for i in range(n - 3): a = a...

2025-12-17

0 29