chong_0428

分类

/ 注册

全部文章（共132篇）

题解 | 合唱队形

def hechang(s, n): m = 0 dp1 = [1]*n dp2 = [1]*n # dp1[0] = 1 # dp2[0] = 1 for i in range(1, n): for j in range(0, i):...

2025-03-15

0 32

题解 | 递推数列

def fun(a0, a1, p, q, k ): dp = [0] * (k+1) dp[0] = a0 dp[1] = a1 for i in range(2, k+1): dp[i] = p*dp[i-1] + q*dp[i-2] ...

2025-03-05

0 34

题解 | 点菜问题

def fun(price, value, n, c): dp = [0] * (c+1) for i in range(n): for j in range(c, price[i] - 1, -1): dp[j] = max(dp[j-pri...

2025-03-05

0 23

题解 | 最大连续子序列

def find_max_subseq(nums, n): """查找最大连续子序列""" # dp[i]表示以i结尾的最大子序列和 dp = nums.copy() # 记录每个位置的起始索引 st...

2025-03-05

0 29

题解 | 整数拆分

#include <stdio.h> #define MOD 1000000000 int dp[1000001]; // 全局数组，避免栈溢出 int split_number(int n) { // 初始化dp数组 for (int i = 0; i <...

2025-03-05

0 37

题解 | 最大上升子序列和

def fun(s, n): dp = s.copy() dp[0] = s[0] for i in range(1, n): for j in range(0, i): if s[i] > s[j]: ...

2025-03-04

0 34

题解 | Sum of Factorials

def mul(a): s = 1 if a == 0 or a == 1: return 1 for i in range(1,a+1): s *= i return s def fac_s(sum, target, i): ...

2025-03-04

0 35

题解 | 全排列

def qpail(num, path, used, n,res): if len(path) == n: res.append(path[:]) return for i in range(len(num)): if used[i...

2025-03-04

0 21

题解 | 守形数

def shouxingshu(a): q = int(a) ** 2 a = list(a) q = list(str(q)) flag = 0 i = len(a) - 1 j = len(q) - 1 while True: ...

2025-02-27

0 39

题解 | 奇偶校验

while True: try: s = input() res = [] for i in s: res = [] if 48 <= ord(i) and ord(i) <= 57...

2025-02-27

0 26