Ldh1315109

分类

/ 注册

全部文章（共36篇）

题解 | 最大正方形

def solve(testcase): n = II() s = [I() for _ in range(n)] A = [] for i in range(n): for j in range(n): if s[i][j...

2025-11-07

0 13

题解 | 铺地毯

def solve(testcase): n = II() res = -1 A = [] for _ in range(n): a, b, g, k = MI() A.append((a, b, g, k)) x...

2025-11-07

0 11

题解 | 小苯的数字排序

def solve(testcase): n = II() A = LII() B, C = [], [] for a in A: if a & 1: C.append(a) else: ...

2025-11-07

0 10

题解 | 小红取数

def solve(testcase): n = II() A = LII() res = 0 for a in A: if a & 1: res += 1 print(-1 if not re...

2025-11-07

0 11

题解 | B=A×A

def solve(testcase): n = II() m = int(sqrt(n)) while (m + 1) * (m + 1) <= n: m += 1 while m * m > n: m -= 1 ...

2025-11-07

0 12

题解 | A-B≠C

def solve(testcase): eps = 1e-8 a, b, c = map(float, input().split()) print("YES" if abs(a - b - c) < eps else "NO"...

2025-11-07

0 12

题解 | A×A=B

def solve(testcase): n = II() m = int(sqrt(n)) while m * m > n: m -= 1 while (m + 1) * (m + 1) <= n: m += ...

2025-11-07

0 9

题解 | 全排列

print('\n'.join(' '.join(map(str, p)) for p in permutations([i for i in range(1, II() + 1)])))

2025-11-07

0 12

题解 | 区间增量与区间前驱

def solve(testcase): n, q = MI() A = LII() blocksz = int(sqrt(n)) blocks = [[] for _ in range(blocksz + 10)] blockinfo = [[] ...

2025-11-02

0 13

题解 | #小跳蛙#

题目链接找单步跳跃的终点，相当于找到最小的，使得内石头的个数对于每个，左侧石头个数为,右侧石头个数为考虑取个左侧石头和个右侧石头此时取的所有石头中，最左侧石头和最右侧石头的距离为是一个单峰函数，所以可以用三分法求符合要求的 #include <bits/stdc++.h&g...

2025-11-01

0 16