牛客303835616号

分类

/ 注册

全部文章（共29篇）

题解 | 最厉害的学生

N = int(input()) T = [] t = [] S = [] for _ in range(N): s, c1, c2, c3 = map(lambda x: int(x) if x.isdigit() else x, input().split()) T.append...

2025-08-26

0 9

题解 | 字符串操作

n, m = map(int, input().split()) s = input() for _ in range(m): a, b, c, d = input().split() a, b = int(a), int(b) s_list = list(s) ...

2025-08-26

0 6

题解 | 简写单词

n = input().split() S = '' for i in n: S += i[0] print(S.upper())

2025-08-25

0 7

题解 | 无限长正整数排列字符串

n = int(input()) k = 0 S = '' while len(S)<=n: S +=str(k) k = k+1 print(S[n])

2025-08-25

0 6

题解 | 凯撒加密

n = int(input()) str = input() re = "" for char in str: m = ord(char) m = m+n while m > 122: m = m - 26 re += ...

2025-08-25

0 6

题解 | 添加逗号

n = str(input()) n1 ='' c = 0 for i in reversed(n) : if c == 3: n1 = ','+n1 c = 0 n1 = i + n1 c = c+1 print(n1)

2025-08-21

0 10

题解 | 杨辉三角

n = int(input()) a = [1] # 第一行 print('1') for i in range(2, n+1): b = [1] # 每行第一个元素是1 for k in range(1, i-1): # 计算中间元素 b.append(a[k...

2025-08-21

0 11

题解 | 上三角矩阵判定

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

2025-08-20

0 8

题解 | 校门外的树

n= input().split() L = int(n[0])+1 k = int(n[1]) c = [] for _ in range(k): l, r = map(int, input().split()) c.append((l, r)) remove = set() fo...

2025-08-20

0 8

题解 | 左侧严格小于计数

n = int(input()) v = input().split(' ') a = [] for i in range(n): k = 0 for j in range (0,i): if int(v[j]) < int(v[i]): ...

2025-08-18

1 11