Ldh1315109

分类

/ 注册

全部文章（共36篇）

题解 | 小红的方神题spj

def solve(testcase): n = II() A = LII() while len(A) > 1: B = [] for i in range(1, len(A)): B.append(abs(A...

2025-11-09

0 8

题解 | 出现奇数次的数

def solve(testcase): n = II() res = 0 for a in LII(): res ^= a print(res) for testcase in range(1): solve(testcase)

2025-11-09

0 9

题解 | 二进制位中1的数量

def popcount(n: int) -> int: n -= ((n >> 1) & 0x5555555555555555) n = (n & 0x3333333333333333) + ((n >> 2) & 0x3333...

2025-11-09

0 8

题解 | 小红的数字分裂

def solve(testcase): n = II() A = LII() g = 0 for a in A: g = gcd(g, a) print(sum(a // g - 1 for a in A)) for testc...

2025-11-09

0 8

题解 | 【模板】分数四则运算

from fractions import Fraction def solve(testcase): a, b, op, c, d = MI() try: A = Fraction(a, b) B = Fraction(c, d) ...

2025-11-09

0 12

题解 | 区间翻转

def solve(testcase): n, k = MI() q = deque() cur = 1 res = [] cl, cr = 0, 0 flag = True for _ in range(k): l, r =...

2025-11-09

0 9

题解 | 小红的三带一

def solve(testcase): n = II() A = LII() dp = [0 for _ in range(n + 1)] def f(idx): c = Counter(A[idx - 3: idx + 1]) ...

2025-11-09

0 8

题解 | 字符串展开

def solve(testcase): a, b, c = MI() s = I() n = len(s) res = [] for i, ch in enumerate(s): if ch != '-': re...

2025-11-07

0 10

题解 | #小红的异或构造#

小红的异或构造令就可以满足条件。 def solve(testcase): print(*[i for i in range(1, II() + 1)]) for testcase in range(1): solve(testcase)

2025-11-07

0 9

题解 | 构造序列

fmin = lambda x, y: x if x < y else y def solve(testcase): n, m = MI() print(fmin(n, m + 1) + m if n > m else fmin(m, n + 1) + n) for ...

2025-11-07

0 10