右置心脏

[PAT] 1034 有理数四则运算 (20分) python这个写法比较好 还是用了fraction和def看起来简洁

lambda介绍Python 字典(Dictionary) items()方法Python 字典(Dictionary) get()方法1085单位排行lambda可以解决多要求的排序问题，通过字典的写入以及items的元组返回，控制输出。

03没过做个N个列表明显超时 10000个数字肯定不行要改怎么在不用多重列表的情况下链接两个数字，不要再一个排序操作之后就丢失原顺序了（记得index的操作），直觉是链表相关。（睡醒了看，现在脑子不太清醒）n = int(input())ckl = list(map(int,input().split()))new = []otpsz = []#数字otpcs = []#次数otp = []for i in range(n): new.append(abs(ckl[i]-(i+1

PAT (Basic Level) Practice Python解法 1020 月饼va, need = map(int,input().split())stock = list(map(float,input().split()))#这里如果是int坑点3会报错，因为是正数，不是正整数sale = list(map(float,input().split()))per = []for i in range(va): dj = float(sale[i]/stock[i]) pe

PAT (Basic Level) Practice Python解法 1027 打印沙漏如果想投机取巧可以直接roll出1000以内的sum直接打入list。i = 1sum = 1lsts = [1]while sum<= 1000: i = i + 2 sum = sum+ i*2 lsts.append(sum)lsts.append(1001)#直接记录了1000以内的所有sum值。cnt, flag = input().split()cnt = i

没写完-PAT (Basic Level) Practice Python解法 1005 继续(3n+1)猜想n = int(input())ckl =list(map(int,input().split()))for hys in ckl: while hys != 1: if hys % 2 == 0: hys = hys / 2 else: hys = (hys * 3 + 1) / 2 if

PAT (Basic Level) Practice Python解法 1024 科学计数法（re.split正则分解）import res = str(input())sf = float(s)a,b,c = re.split('[.|E]',s)#正则多标识符分割if a[0]=='+': flag = ''else: flag = '-'#输出的正负a = a[1]#整数部分if int(c)==0:#指数为0，直接输出原始数字 print(flag,a,'

PAT (Basic Level) Practice Python解法 1004 成绩排名（和1028/1004类似/平方/开方sqrt）import sysimport mathn = int(input())low = math.sqrt(2)*100high = 0lowotp = ''highotp = ''for i in range(n): s = sys.stdin.readline() sl = s.split(' ')#py中的平方是**，开方是sqrt

sys读入的时候会把换行符也读进去1028没想到办法怎么在不产生列表的前提下直接进行未知数量的切片存取，用re可能可以。import sysn = int(input())low = 100high = 0lowotp = ''highotp = ''for i in range(n): s = sys.stdin.readline()#readline的字符串后面跟了一个/n sl = s.split(' ')#先用split做吧 if int(sl[-1])&l

1003 我要通过 python实现import re n=input() for i in range(int(n)): s=input() if re.match(r'A*PA+TA*',s): #在字符串中进行匹配 a=re.split(r'[P|T]',s) #以字符P,T进行分段 if a[0]*len(a[1])==a[2]: #条件判断 print('YES') else: .

PAT (Basic Level) Practice Python解法 1040 有几个PAT（find逆序遍历查找/重复计量算法）import syss = sys.stdin.readline()s = s[s.find('P'):s.find('T',len(s)-1,-1)]#先卡掉开头不是P的，结尾不是T的#字符串反应太快了，截取花的时间超过了测试用例里的无效字符判断时间cnT = 0cnA = 0cnP = 0for i in s[::-1]: if i == 'T':

存档0009PAT (Basic Level) Practice Python解法 1039 到底买不买（replace用法）import syssale = sys.stdin.readline()goal = sys.stdin.readline()cnt = 0sale1 = salegoal1 = goalfor i in goal: if i in sale1: cnt+=1 sale1 = sale1.replace(i, '',1)#rep

override超控/覆写失控玩家free guy里key在硬重启之前写了一个override的程序，超控改了物理引擎造桥。Java中override和overload的区别与使用覆写-重写（override）子类定义与父类完全相同（不算权限）的方法或者属性称为覆写。...

PAT (Basic Level) Practice Python解法 1062 最简分数（最简分数判定gcd/分子范围控制）import matha, b, fm =input().split(' ')fm = int(fm)a1 = a.split('/')b1 = b.split('/')num1 = int(a1[0])/int(a1[-1])num2 = int(b1[0])/int(b1[-1])if num1>num2: num1,num2 = num2,num1

PAT (Basic Level) Practice Python解法 1072 开学寄语stu, things = map(int,input().split())bad = input().split()cntxs = 0cntdx = 0for i in range(stu): info = input().split() kck = [] dx = info[2:]#这个设置真的很有必要，防止我后面颠来倒去看不清楚 for sth in dx:

PAT (Basic Level) Practice Python解法 1042 字符统计ckl = [0]*26import sysinfo = sys.stdin.readline()info = info.lower()for s in info: if s.islower(): ckl[ord(s)-97]+=1num = ckl.index(max(ckl))print(chr(num+97),max(ckl))

炸坑超时 PAT (Basic Level) Practice Python解法 1032 挖掘机技术哪家强（不要连等指向/+=1）很明显坑点3是因为容器存取超时了，暂时懒得解决了。三分留给10月的我。import sysn=int(input())xxdata = []cjdata = []#不要写连等，会相同指向疯狂报错！！！for i in range(n): info = sys.stdin.readline() school = info[0:info.find("

PAT (Basic Level) Practice Python解法 1033 旧键盘打字（str大小写转换判断）bad = input()ckl = input()if ('+' in bad):#大写打不出来 for item in ckl: if (not item.isupper()) and (item.lower() not in bad) and (item.upper() not in bad): print(item,end='')

炸坑 PAT (Basic Level) Practice Python解法 1019 数字黑洞这题还能运行超时，我服了。num = input()if len(set(list(num)))==1: print(num,'-',num,'= 0000')else: cha = '' while cha != "6174": s1 = ''.join(sorted(list(num),reverse=False))#升序 s2 = ''.joi

炸坑 PAT (Basic Level) Practice Python解法 1014 福尔摩斯的约会a = input()b = input()c = input()d = input()for i in range(min(len(a),len(b))): if a[i].isupper() and a[i]==b[i]: days = a[i] cdd = i breakfor i in range(cdd+1,min(len(a),