laingdc

分类

/ 注册

全部文章（共87篇）

题解 | 灵异背包？

import sys l = int(input()) ls = list(map(int,input().split())) s = 0 ji = [] ou = [] for l in ls: if l%2 == 0: ou.append(l) else: ...

2026-05-13

0 10

题解 | 小红的字符串

import sys def dis(a,z): # 计算从a变到z需要的最小操作次数 dis1 = abs(ord(a)-ord(z)) if dis1 > 13: dis1 = 26-dis1 return dis1 # print(dis(...

2026-05-13

0 19

题解 | 迷宫

import sys from collections import deque def judge(rset,cset,visits): # 判断从行集合和列集合打激光能不能碰到visits的点 # 先判断行集合 for rs in rset: if 1 i...

2026-05-13

0 18

题解 | 挡住洪水

import sys from collections import deque r,c = map(int,input().split()) data = [] for _ in range(r): data.append(list(input())) dirs = [(1,0), (-...

2026-05-13

0 15

题解 | 剪纸游戏

from re import M import sys from collections import deque dirs = [(1,0), (-1,0), (0,1), (0,-1)] # 判断这个区间内是不是都是矩形 def judge(ma,mi): for i in range(...

2026-05-13

0 15

题解 | 剪纸游戏

DFS会爆栈 from re import M import sys from collections import deque dirs = [(1,0), (-1,0), (0,1), (0,-1)] # 判断这个区间内是不是都是矩形 def judge(ma,mi): for i in...

2026-05-13

0 18

题解 | 走迷宫

import sys from collections import deque r , c = map(int,input().split()) sx,sy,ex,ey = map(int,input().split()) grid = [] for _ in range(r): gri...

2026-05-13

0 19

题解 | 迷宫问题

import sys from collections import deque r, c = map(int,input().split()) data = [] prev = [[None for _ in range(c)] for _ in range(r)] for _ in range(...

2026-05-13

0 17

题解 | 小A的线段（easy version）

#include <iostream> #include <vector> using namespace std; int n, m; int cnt = 0; vector<pair<int, int>> line; // DFS：idx当前处...

2026-05-13

1 19

题解 | kotori和素因子

from re import I import sys import math # 获取素因子 def getp(n): res = [] for i in range(2,n+1): while n % i ==0: res.append(i...

2026-05-13

0 16