牛客303835616号

分类

/ 注册

全部文章（共34篇）

题解 | 添加逗号

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 28

题解 | 杨辉三角

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 32

题解 | 上三角矩阵判定

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 24

题解 | 校门外的树

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 19

题解 | 左侧严格小于计数

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 36

尾递归解决类斐波那契数列

n = int(input()) def A(i,a,b,c): if i ==1: return(a) elif i == 2: return(b) elif i == 3: return(c) else: ...

2025-08-18

0 37

题解 | 牛牛数数

n = int(input()) for i in range(1, n+1): if i % 4 != 0: # 首先排除4的倍数 num = i # 使用临时变量处理 has_four = False while num > 0:...

2025-08-18

0 31

题解 | 数位之和

n = int(input()) if n< 0 : n = -1 * n #对n做绝对值处理 k=1 m = 0 a = 0 while k < 10: #限定最多九位数 if n <10: break #当n仅有一位的时候无法继续对10取余数，...

2025-08-18

1 39

利用尾递归解决斐波那契问题

def fbnq(n,a,b): if n == 1 : return(a) else : return fbnq(n-1,b,a+b) n = int(input()) print (fbnq(n,1,1))

2025-08-14

1 20

题解 | 最大的差

T = int (input()) n = input().split() a = max(n,key=int) b = min (n,key=int) c = int(a)-int(b) print (c)

2025-08-14

0 36