- 博客(4)
- 收藏
- 关注
原创 【思特奇杯·云上蓝桥-算法集训营】第3周
509.斐波那契数 class Solution: def fib(self, n: int) -> int: assert (n >= 0), 'n must be >= 0' if n == 0: return 0 elif n == 1: return 1 else: return self.fib(n-1) + self.fib
2022-01-24 22:50:30
112
原创 【思特奇杯·云上蓝桥-算法集训营】“思特奇杯”编程之星初赛
试题A:门牌制作 答案:624 count = 0 for i in range(1, 2021): n = i while n != 0: m = n % 10 n = n // 10 if m == 2: count += 1 print(count) 试题B:寻找2020 答案:2481215 def check(s): return s == '2020' matrix = [] s = i
2022-01-24 22:20:18
4799
原创 【思特奇杯·云上蓝桥-算法集训营】第2周
1.带分数 num = int(input()) ans = 0 for n in range(1, num+1): if '0' in str(n) or len(set(list(str(n)))) != len(str(n)): continue diff = num - n s = '123456789' for i in str(n): s = s.replace(i, '') for length in ra
2022-01-19 10:25:19
77
原创 【思特奇杯·云上蓝桥-算法集训营】第1周
1.跑步训练 答案:3880 x = 10000 t = 120 while x!= 0: if t == 0 or t % 120 < 60: x -= 10 t += 1 else: x += 5 t += 1 print(t-120) 2.阶乘约数 答案:39001250856960000 m = [i for i in range(1, 101)] x = [2] for i in range(
2022-01-11 21:08:32
49
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人