chong_0428

分类

/ 注册

全部文章（共128篇）

题解 | #采药#

def best(sum, time, value, n): dp = [0]*(sum+1) dp[0]=0 for i in range(0, n): for j in range(sum, time[i]-1, -1): dp[j...

2024-03-10

0 178

题解 | #点菜问题#

def best(c, p, v, n): dp = [0]*(c+1) dp[0] = 0 for i in range(0, n): for j in range(c, p[i]-1, -1): dp[j] = max(dp[j],...

2024-03-10

0 185

题解 | #放苹果#

def apple(m, n): dp = [[0 for i in range(n+1)] for j in range(m+1)] for i in range(1, m+1): dp[i][1] = 1 for j in range(1, n+1...

2024-03-09

0 168

题解 | #密码翻译#

def coding(s): s = list(s) for i in range(len(s)): if ord(s[i]) >= ord('a') and ord(s[i]) <= ord('y') or ord(s[i]) >= ord('A'...

2024-03-09

0 209

题解 | #日志排序#

datas = [] while True: try: line = input().strip() if not line: break datas.append(line) except EOFError: ...

2024-03-07

1 218

题解 | #查找学生信息#

while True: try: ide = [] name = [] sex = [] age = [] flag = 0 n = int(input()) for i...

2024-03-06

0 184

题解 | #剩下的树#

while True: try: arr=[] L, M = map(int, input().split()) for i in range(L+1): arr.append(1) for i in r...

2024-03-06

0 158

题解 | #最大序列和#

# def max(a, b): # if a>b: # return a # else: # return b def seqmax(s): dp=[0]*1000000 A = [0] k=1 for i i...

2024-03-06

0 177

题解 | #今年的第几天？#

def Day(y, m, d): day = 0 if y % 400 == 0 or (y % 4 == 0 and y % 100 !=0): f = 1 else: f=0 for i in range(1, 13): ...

2024-03-06

1 204

题解 | #求最大最小数#

while True: try: n = int(input()) a = list(map(int, input().split())) res = sorted(a) print("%d %d"%(res...

2024-03-06

0 178