chong_0428

分类

/ 注册

全部文章（共132篇）

题解 | 最小长方形

def quare(a, b): max_x = max(a) max_y = max(b) min_x = min(a) min_y = min(b) return min_x, min_y, max_x, max_y while True: tr...

2025-02-25

0 27

题解 | 还是畅通工程

#include<stdio.h> #include<math.h> #include<stdlib.h> struct Point{ int x; int y; }; struct Edge{ int from; int to;...

2025-02-25

0 21

题解 | Hello World for U

def U(s, n): n1 = n2 = n // 3 r = n % 3 if r == 0: n1 -= 1 n2 -= 1 n3 = n - 2 * n1 m1 = s[:n1] m3 = s[n1:n3+n...

2025-02-25

0 27

题解 | 继续xxx定律

def generate_sequence(n): """生成xxx定律序列""" if not 1 < n <= 1000: return [] sequence = [] ...

2025-02-25

0 24

题解 | 统计同成绩学生人数

while True: try: n = int(input()) if n == 0: break s = list(map(int, input().split())) a = int(input(...

2025-02-24

0 30

题解 | ZOJ

def zoj(s): z, o, j = [], [], [] iz, io, ij = 0, 0, 0 res = [] for i in s: if i == 'Z': z.append(i) elif i...

2025-02-24

0 35

题解 | 统计字符

def str_match(s, t): res = {} # for i in range(len(t)): # res[t[i]] = 0 c = 0 for i in t: c = 0 for j in s: ...

2025-02-23

0 36

题解 | 畅通工程

#include <stdio.h> #include <string.h> int father[1000]; int height[1000]; // Add proper parameter types in function declarations void i...

2025-02-23

0 24

题解 | 字母统计

def tongji(s): res = {} for i in range(26): w = ord('A') + i w = chr(w) res[w] = 0 for j in s: for i in ra...

2025-02-23

0 35

题解 | Flipping Pancake

'''关于Pancake sorting的一种简单情况。就是有种方法可以保证至多2n-3次完成。类似于选择排序：先找出n各数字种最大的一个数n，假设所在位置为sn，那么先翻转前sn个数字f(sn)，使得n在最顶部，之后再翻转前n个元素f(n)，这样一来n就到了最底部。就是两次翻转。之后再选...

2025-02-23

0 24