在人才库的可乐很喜欢吃火锅

分类

/ 注册

全部文章（共11篇）

题解 | 拦截导弹

import sys def dp(num,height): dp=[1]*num for i in range(1,num): for j in range(0,i): dp[i]=max(dp[j]+1,dp[i]) if height[j...

2026-03-17

0 37

题解 | 点菜问题

import sys def dp(num,total,weight,value): #dp[i][j]=max(dp[i-1][j],dp[i-1][j-weight[i-1]+value[i-1]]) dp=[0]*(total+1) for i in range(1,n...

2026-03-16

0 38

题解 | 神奇的口袋

import sys def dp(num,it): #dp[i][j]=dp[i-1][j]+dp[i-1][j-weight[i-1]] weight=[] for _ in range(num): item=int(next(it).strip()) ...

2026-03-16

0 30

题解 | 首字母大写

import sys import re if __name__=="__main__": for line in sys.stdin: line=line.strip() def repl(m): word=lis...

2026-03-14

0 45

题解 | 数制转换

import sys if __name__ =='__main__': for line in sys.stdin: data=list(line.strip().split()) jinzhi=int(data[0]) number=int...

2026-03-14

0 40

题解 | 单词替换

import sys import re if __name__=='__main__': it=iter(sys.stdin) while 1: try: line=next(it).strip() old=next(...

2026-03-14

0 38

题解 | 全排列

import sys def backtracking(target,loc,tem,ans,set1): if len(tem)==len(target): s=''.join(tem) ans.append(s) for i in range(le...

2026-03-12

0 36

题解 | 日志排序

import sys def func(s): tem = s.split() first = float(tem[3][:-3]) time_key = tem[1] + ' ' + tem[2] return first, time_key def sort(da...

2026-03-10

0 37

题解 | 剩下的树

import sys def remove(total,num,it): data=[] for _ in range(num): tem=list(map(int,next(it).strip('\n').split())) data.append(...

2026-03-09

0 51

题解 | 最小邮票数

import sys def dp(total,num,it): #dp[i][j]=min(dp[i-1][j],dp[i-1][j-weight[i]]+1) weight=list(map(int,next(it).strip('\n').split())) dp=[f...

2026-03-07

0 45