爱读书的菠萝蜜很想去杭州

分类

/ 注册

全部文章（共62篇）

题解 | 斗兽棋

import re import sys bro,sis = input().split() ani_sor = ['elephant','tiger','cat','mouse'] bro_idx = ani_sor.index(bro) sis_idx = ani_sor.index(sis) ...

2025-06-08

2 27

题解 | 年轻人不讲5的

s = input() s_sub = s.replace('5','*') print(s_sub)

2025-06-08

0 33

题解 | 扫雷

import sys n,m = map(int,input().split()) a = [li for li in sys.stdin] total = [['*']*m for _ in range(n)] for i in range(n): for j in range(m): ...

2025-06-08

0 22

题解 | 杨辉三角

n = int(input()) a = [[0]*n for _ in range(n)] s = '' for i in range(n): for j in range(i+1): if j == 0: a[i][j]=1 els...

2025-06-07

0 24

题解 | 矩阵转置

n,m = map(int,input().split()) a = [list(map(int,input().split())) for _ in range(n)] a_reverse = [[0]*n for _ in range(m)] for i in range(n): for...

2025-06-07

0 19

题解 | 上三角矩阵判定

import sys n = int(input()) a = [list(map(int,input().split())) for _ in range(n)] for i in range(1,n): for j in range(i): if a[i][j] != 0...

2025-06-07

0 19

题解 | 校门外的树

l,m = map(int,input().split()) tree_list = [1]*(l+1) for _ in range(m): left,right = map(int,input().split()) tree_list[left:right+1]=[0]*(rig...

2025-06-06

0 27

题解 | 约瑟夫环

n, k, m = map(int, input().split()) people = list(range(n)) index = k % n # 起始位置 while len(people) > 1: # 计算待移除位置 index = (index + m - 1...

2025-06-06

0 17

题解 | 记数问题

num_list = list(map(int,input().split())) n,x = num_list[0],str(num_list[1]) count = 0 for i in range(1,n+1): for s in str(i): if s == x: ...

2025-06-06

0 25

题解 | 牛牛的数学作业

from math import inf import sys t = int(input()) input_stata = [li for li in sys.stdin] num_li = [[] for pa in range(t)] n = [0] * t for idx, ele in ...

2025-06-06

0 21