苦闷的芒果在看数据

分类

/ 注册

全部文章（共27篇）

题解 | 小红的排列构造②

import sys while True: try: n = int(input()) s = input() if s[-1] == '0': print(-1) else: ...

2025-12-12

0 5

题解 | 气球谜题(Python解法，但是超时

import sysfrom itertools import permutationswhile True: try: n = int(input()) s = input() val = list(map(int,input().split()))...

2025-12-10

0 9

题解 | 宝石手串

import sys while True: try: t = int(input()) for _ in range(t): n = int(input()) s = input() ...

2025-12-09

0 6

题解 | 小红的矩阵染色

import sys while True: try: n,m,k = map(int,input().split()) bod = [] arr = [] sep = 0 for _ in range(n):...

2025-12-01

0 8

题解 | 小红的矩阵染色

import sys while True: try: n,m,k = map(int,input().split()) bod = [] arr = [] sep = 0 for _ in range(n):...

2025-12-01

0 8

题解 | Redraiment的走法

import sys while True: try: n = int(input()) lst = list(map(int,input().split())) ans = 1 rec = [1]*n for...

2025-12-01

0 7

题解 | 自守数

import sys while True: try: n = int(input()) total = 1 for i in range(1,n+1,10): l_i = len(str(i)) ...

2025-12-01

0 6

题解 | 小心火烛的歪

import sys def merge(fire,plan):#实施计划 for i in range(len(fire)): fire[i] = fire[i] | plan[i] def checkok(grass,plan):#检查计划是否可行 for i...

2025-11-28

0 12

题解 | 小心火烛的歪

import sys def merge(fire,plan):#实施计划 for i in range(len(fire)): fire[i] = fire[i] | plan[i] def checkok(grass,plan):#检查计划是否可行 for i...

2025-11-27

0 11

题解 | 数组分组

from os import sep import sys def seprate(lst,a,b): if not lst: if a == b: return True else: return False...

2025-11-27

0 10