爱吃的代码渣渣许愿简历通过
爱吃的代码渣渣许愿简历通过
全部文章
分类
归档
标签
去牛客网
登录
/
注册
爱吃的代码渣渣许愿简历通过的博客
全部文章
(共81篇)
题解 | 无限长正整数排列字符串
n = int(input()) S = " " for i in range(n): S = S + str(i+1) print(S[n])
2025-12-30
0
31
题解 | 凯撒加密
n = int(input()) s = str(input()) mima = [] for i in range(len(s)): mima.append(chr((ord(s[i]) - ord('a') + n) % 26 + ord('a'))) #超过z print(''...
2025-12-28
0
30
题解 | 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
32
题解 | 添加逗号
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
31
题解 | 斗兽棋
s1, s2 = map(str, input().split()) rlues = {"elephant":"tiger", "tiger":"cat", "cat":"...
2025-12-21
0
27
题解 | 年轻人不讲5的
char = input() print(char.replace('5', '*'))
2025-12-21
0
20
题解 | 扫雷
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
37
题解 | 杨辉三角
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
20
题解 | 矩阵转置
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
23
题解 | 上三角矩阵判定
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
25
首页
上一页
1
2
3
4
5
6
7
8
9
下一页
末页