在看机会的袋鼠很威猛

分类

/ 注册

全部文章（共2篇）

题解 | 小红的排列构造②

import sys def find(): n = int(input()) sstr = input() if sstr[-1]=='0': return [-1] f = [i + 1 for i in range(n)] for i ...

2025-06-24

0 17

题解 | 字符串排序

import sys def merge(f, m, n, k): i = m j = k + 1 x = 0 fn = [" "] * (n - m + 1) while (i <= k) and (j <= n): ...

2025-06-21

0 12