weixin_41041275的博客

201403-3 命令行选项form = input()n = int(input())single_var = []multi_var = []# store optionsform += " "for i in range(len(form)-1): if form[i+1]==':': multi_var.append(form[i]) elif form[i]!=':': single_var.append(form[i])fo

201409-3 字符串匹配import reS = input()sensitive = int(input())n = int(input())data = []for i in range(n): data = input() if sensitive == 1: if re.search(S,data) != None: print(data) else: # re.IGNORECASE的意思就是忽略大

201412-3 集合竞价import sysrecords = []# ctrl+D stopfor line in sys.stdin: record = line.split() records.append(record)# search 'cancel' and set it as ""; transfer "buy" and "sell" string data as float or int type for record in records: if

201509-3 模版生成系统import rem,n = map(int,input().split())template = []for i in range(m): template.append(input())var = {}for i in range(n): # str.split(str="", num=string.count(str)). # print str.split(' ', 1 ); # 以空格为分隔符，分隔成两个 # eva

201612-3 权限查询""" # 对于分等级权限，格式为 <category>:<level>，其中 <category> 是权限类名， <level> 是该类权限的最高等级。对于不分等级权限，字符串只包含权限类名。 crm:2 ['crm',''2] rank git:3 ['git','3'] rank game ['game'] no rank # print(quanxian)

import jsonn,m = map(int,input().split())json_str=""for i in range(n): json_str += input()data = json.loads(json_str)"""type(data) : dict{'firstName': 'John', 'lastName': 'Smith', 'address': {'streetAddress': '2ndStreet', 'city': 'NewYork', '.

201312-1 出现次数最多的数n = int(input())data = list(map(int,input().split()))result = {}for i in range(n): if data[i] not in result: result[data[i]] = data.count(data[i])result_sort = sorted(result.items(),key=lambda x:(-x[1],x[0]))print(resul

201403-1 相反数n=int(input())data =list(map(int,input().split()))a = []b = []for i in range(n): if data[i] > 0: a.append(data[i]) if data[i] < 0: b.append(abs(data[i]))c = set(a) & set(b)print(len(c))201403-2 窗口自

201409-1 相邻数对n=int(input())data = list(map(int,input().split()))data.sort()result=[]for i in range(1,n): if data[i]-data[i-1]==1: result.append((data[i-1],data[i]))print(len(result))201409-2 画图一次做对！开心n=int(input())data =[]for i

201412-1 门禁系统n=int(input())data = list(map(int,input().split()))reader={}for i in range(n): if data[i] not in reader: reader[data[i]] = 0 reader[data[i]] += 1 print(reader[data[i]],end=" ") 201412-2 Z字形扫描n=int(input())data = [

201503-1 图像旋转居然一次性做对了，太感动了！n,m = map(int,input().split())data = [list(map(int,input().split())) for _ in range(n)]""" 0 1 20 1 5 31 3 2 4-> 0 10 3 41 5 22 1 3"""reverse = [[] for _ in range(m)]for j in range(m): for i in range(n

201509-1 数列分段n = int(input())data = list(map(int,input().split()))duan = 1for i in range(n-1): if data[i]!=data[i+1]: duan+=1print(duan)201509-2 日期计算没有break会扣10分！一定要记住！y = int(input())d = int(input())m = 1r = 1month = [31,28,31,

201512-1 数位之和n = list(map(int,input()))result = sum(n)print(result)201512-2 消除类游戏参考别人的实现，自己写得过于复杂n,m = map(int,input().split())temp=[[0]*m for _ in range(n)]cheer = []for i in range(n): cheer.append([]) cheer[i]=list(map(int,input().

201604-1 折点计数n = int(input())data = list(map(int,input().split()))zhe = 0for i in range(1,n-1): if (data[i-1]< data[i] and data[i+1]< data[i]) or (data[i-1]> data[i] and data[i+1]>data[i]): zhe+=1print(zhe)201604-2 俄罗斯方块能

201609-1 最大波动满分实现：n = int(input())data = list(map(int,input().split()))cha = []for i in range(1,n): cha.append(abs(data[i]-data[i-1]))print(max(cha))201609-2 火车购票按自己的思路写的稍微复杂了点，但是感觉应该很好理解！满分实现：n = int(input())data = list(map(int,input().sp

201612-1 中间数自己做都是50分，从两边往中间走，这里参考别人满分实现代码从中间向两边走：n = int(input())data = list(map(int,input().split()))data_sort = sorted(data)middle = n//2before = n//2after = n//2while before>0 and data_sort[middle] == data_sort[before-1]: before-=1w

201703-1 分蛋糕满分实现：n,k = map(int,input().split())a_list = list(map(int,input().split()))a=0child = 0for i in range(len(a_list)): if a == 0 and a_list[i]>=k: child+=1 continue if a+a_list[i] >=k: child+=1 a

201709-1 打酱油满分实现：N = int(input())n_5 = N//50n_3 = (N - n_5*50)//30n_1 = (N-n_5*50-n_3*30)//10num = n_5*7+n_3*4+n_1print(num)201709-2 公共钥匙盒满分实现：N,K = map(int,input().split())time = {}key_init = [i+1 for i in range(N)]for i in range(K):

201712-1 最小差值满分实现：n = int(input())data = list(map(int,input().split()))data_sort = sorted(data)cha = []for i in range(1,n): cha.append(abs(data_sort[i]-data_sort[i-1]))print(min(cha))201712-2 游戏满分实现：n,k = map(int,input().split())child = [

201803-1 跳一跳满分代码：data = list(map(int,input().split()))last_condition = 0score = 0for i in range(len(data)): if data[i] == 0: break elif data[i] == 1: last_condition = 1 score+=1 elif data[i] == 2: if i == 0

201809-1 卖菜n = int(input())data = list(map(int,input().split()))price = []for i in range(n): if i == 0: price.append((data[i]+data[i+1])//2) continue if i == n-1: price.append((data[i-1]+data[i])//2) continue

201812-1 小明上学r,y,g = map(int,input().split())n = int(input())T = 0for i in range(n): k,t = map(int,input().split()) if k == 0: T += t elif k == 1: # red T += t elif k == 2: # yellow T += (t+r)

代码-100分：n = int(input())for i in range(n): y = input() y = y.replace('x','*') y = y.replace('/','//') y = eval(y) if y == 24: print("Yes") else: print("No")其实第一次做是70分，因为没审题，没注意到题目说的是“整除”！一定要细细审题！警醒自己一下！...

代码-100分：n = int(input())data = list(map(int,input().split()))max_data = max(data)min_data = min(data)if n%2 == 0: mid = (data[n//2]+data[n//2-1])/2else: mid = data[n//2]if mid == int(mid): mid = int(mid) print('{}{}{}{}{}\n'.forma..

201909-1 小明种苹果贴代码-100分：N,M = list(map(int,input().split()))T = 0K = 0 P = 0 for i in range(N): apple = list(map(int,input().split())) T += apple[0] shuguo_number = 0 for j in apple[1:]: T += j shuguo_number += abs(j)

201912-2 回收站选址代码写的可能比较繁琐，但是是我的第一下思考的一个过程，优化过程可以参考别人的代码运行100分（我记得考试的时候刚开始想了特别久，还想着构建一个二维矩阵，用了很久时间发现根本行不通，不过还好及时想出使用列表即可）n = int(input())address_rating = [0]*5address = []for _ in range(n): address.append(list(map(int,input().split())))for i i

201912-1 报数看到这道题真的太难过了！上次考试就是在这里扣了20分！（默默抹眼泪）也忘记了具体错在哪里了，自我感觉没错，放了这么久，重新做一遍，系统上终于是100分了！太可惜了！菜鸟的进阶之路还很漫长！n = int(input())def is_seven(num): if num%7==0 or '7' in list(str(num)): return 1 else: return -1a = []m = 0number =

202006-2 稀疏向量这道题思路真的很简单，但是我一直做不对！最多60分了。两种方法：使用字典，显示“运行超时”：data = list(map(int,input().split()))n,a,b = data[0],data[1],data[2]out = 0u = {}v = {} for i in range(a+b): u1,u2 = map(int,input().split()) if i < a: u[u1]=u2

202006-1 线性分类器第一次做是0分，经过修改终于100分了！data = list(map(int,input().split()))n,m=data[0],data[1]li = []test = []flag = 'No'for _ in range(n): li.append(list(input().split()))for _ in range(m): test.append(list(map(int,input().split())))for d