牛客303835616号

分类

/ 注册

全部文章（共29篇）

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

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 12

题解 | 牛牛数数

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 9

题解 | 数位之和

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 14

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

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 11

题解 | 最大的差

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 19

题解 | 牛牛学数列

n = int(input()) S = 0 for i in range (1,n+1): S = S+(-1)**(i-1)*i print (S)

2025-08-14

0 14

题解 | 素数判断

import math T = int (input()) for _ in range(T): a = int (input()) if a == 1 : print ('No') elif a == 2: print ('Yes') ...

2025-08-14

0 16

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

input_str = input() # 分割字符串得到数字列表 numbers = input_str.split() # 移除列表中的所有 '0' numbers = [x for x in numbers if x != '0'] # 转换为整数列表 numbers = list(map...

2025-08-13

0 13

题解 | 斗兽棋

a = input().split() t = 'tiger' e = 'elephant' c = 'cat' m = 'mouse' niu = a[0] mei = a[1] if niu == t: if mei == c: print ('win') eli...

2025-08-13

0 17

题解 | 疫情死亡率

import sys for line in sys.stdin: a = line.split() if len(a) >= 2 and int(a[0]) != 0: # 检查数组长度和除数不为零 result = int(a[1]) / int(a[0...

2025-08-13

0 20