蓝桥杯
Shoko0116
这个作者很懒,什么都没留下…
展开
-
蓝桥杯 平方末尾
Codenum = [0 for _ in range(100)]for i in range(100): num[i * i % 100] = 1print(num.count(1))Result22原创 2022-02-09 19:24:11 · 6180 阅读 · 0 评论 -
蓝桥杯 螺旋折线
Codex, y = map(int, input().split(' '))# 累加公式乘2def preSum(n): return n ** 2 + nif x > 0: if abs(x) >= abs(y): ans = preSum(2 * x - 1) + 2 * x if y <= 0: ans += x + abs(y) # else: ans += x - y # el...原创 2022-01-24 00:11:19 · 5495 阅读 · 0 评论 -
蓝桥杯 等差数列
Coden = int(input())nums = list(map(int,input().split()))nums.sort()length = len(nums)cha = 100000for i in range(length - 1- 1): if cha > nums[i + 1] - nums[i]: cha = nums[i + 1] - nums[i]if cha == 0: print(length)else: prin.原创 2022-01-14 00:24:57 · 90 阅读 · 0 评论 -
蓝桥杯 年号字串
Codeans, num = '', 2019while num: ans += f"{chr(num % 26 + ord('A') - 1)}" num //= 26print(ans[::-1])ResultBYQ原创 2022-01-12 23:58:43 · 112 阅读 · 0 评论 -
蓝桥杯 旋转
Coden, m = map(int, input().split())re = [[0 for _ in range(n)] for _ in range(m)]for row in range(n): values = list(map(int, input().split())) for col in range(m): re[col][n - row - 1] = values[col]for line in re: print(' '.join..原创 2022-01-11 23:48:54 · 474 阅读 · 0 评论 -
蓝桥杯 成绩分析
Codeif __name__ == '__main__': nums = [int(input()) for _ in range(int(input()))] print(f"{max(nums)}\n{min(nums)}\n{(sum(nums) / len(nums)):.2f}")原创 2022-01-08 23:39:17 · 217 阅读 · 0 评论 -
蓝桥杯 蛇形填数
n行n列的数依次是: 1 5 13 25 41 相邻两者相差: 4 8 12 16Codere = 1for i in range(20): re += i * 4print(re)Result761原创 2022-01-07 23:13:05 · 540 阅读 · 0 评论 -
蓝桥杯 成绩统计
Codenum = eval(input())jige, youxiu = 0, 0for i in range(n): score = int(input()) if score >= 85: youxiu += 1 if score >= 60: jige += 1print(f"{round(100 * jige / num)}%")print(f"{round(100 * youxiu / num)}%")原创 2022-01-06 22:34:50 · 685 阅读 · 0 评论 -
蓝桥杯 排序
最坏情况,全部逆序i = 1sum = 0while(sum <= 100): sum += i i += 1print(sum)print(i)10515所以有abcdefghijklmno这15个字母,将onmlkjihgfedcba减去5次移动,得到jonmlkihgfedcba,进而验证Codedef bubble_sort_count(l): ct = 0 for i in range(len(l)): for j i.原创 2022-01-04 22:40:56 · 503 阅读 · 0 评论 -
蓝桥杯 美丽的2
Codeans = 0for i in range(1, 2021): if(str(i).count('2')): ans += 1print(ans)Result563原创 2021-12-31 15:26:49 · 300 阅读 · 0 评论 -
蓝桥杯 约数个数
Codeans = 1 # 加上它本身# 只需迭代到本身的一半即可for i in range(1, int(78120 / 2) + 1): if 78120 % i == 0: ans += 1print(ans)Result96原创 2021-12-31 13:08:24 · 637 阅读 · 0 评论 -
蓝桥杯 既约分数
Codedef gcd(a, b): return a if b == 0 else gcd(b, a % b)if __name__ == '__main__': ans = 0 for zi in range(1, 2021): for mu in range(1, 2021): if gcd(zi, mu) == 1: ans += 1 print(ans)Result248121.原创 2021-12-30 00:06:54 · 340 阅读 · 0 评论 -
蓝桥杯 扩散
Codeans = 0for x in range(-2020, 2020 + 2020 + 1): for y in range(-2020, 2020 + 2020 + 1): for x_, y_ in [(0, 0), (2020, 11), (11, 14), (2000, 2000)]: # 求曼哈顿距离,即横纵坐标每加一都要传播一次 if abs(x - x_)+abs(y - y_) <= 2020: .原创 2021-12-28 22:23:05 · 349 阅读 · 0 评论 -
蓝桥杯 门牌制作
Codere = 0for i in range(1, 2021): re += str(i).count('2')print(re)Result624原创 2021-12-27 10:29:16 · 145 阅读 · 0 评论