壹壹风荷举
壹壹风荷举
全部文章
分类
归档
标签
去牛客网
登录
/
注册
壹壹风荷举的博客
全部文章
(共47篇)
题解 | 杨辉三角
n=input() n=int(n) row=[0]*n for i in range(n): new_row=[1]*(i+1) for j in range(1,i): new_row[j]=row[j-1]+row[j] row=new...
2025-09-07
0
21
题解 | 校门外的树
import sys a = sys.stdin.readline().split() L, M = int(a[0]), int(a[1]) hash = dict.fromkeys(range(L + 1), 1) for _ in range(M): tree = sys.stdin...
2025-09-07
0
22
题解 | 约瑟夫环
import sys for line in sys.stdin: a = line.split() n, k, m = int(a[0]), int(a[1]), int(a[2]) list = list(range(n)) while len(list)>...
2025-09-07
0
22
题解 | 数组计数维护
import sys line=sys.stdin.readline().strip() test=int(line) for _ in range(test): s,cnt=0,0 a=sys.stdin.readline().split() n,k=int(a[0]...
2025-09-07
0
18
题解 | 左侧严格小于计数
import sys n = int(sys.stdin.readline().strip()) l = list(map(int, sys.stdin.readline().split())) counts = [0] * 11 for num in l: # 计算前面比当前元素小的元...
2025-09-06
0
16
题解 | 神秘石像的镜像序列
import sys for line in sys.stdin: a = line.split() a=list(map(int,a)) a[:]=a[-2::-1] print(' '.join(map(str,a)))
2025-09-06
0
22
题解 | 二维斐波那契数列
import sys for line in sys.stdin: a = line.split() n,m=int(a[0]) , int(a[1]) nm=[m*[1] for _ in range(n)] for i in range(1,n): ...
2025-09-06
0
23
首页
上一页
1
2
3
4
5
下一页
末页