lizzyoo

分类

/ 注册

全部文章（共9篇）

题解 | 计树

import sys sys.setrecursionlimit(1 << 25) n = int(input()) tree = [[] for _ in range(n + 1)] for _ in range(n - 1): u, v = map(int, input()...

2025-07-23

0 33

题解 | 小红的双生英雄

import sys input = sys.stdin.readline n, C, m = map(int, input().split()) heroes = [tuple(map(int, input().split())) for _ in range(n)] paired = set...

2025-07-21

0 29

题解 | 识别有效的IP地址和掩码并进行分类统计

def is_valid_ip(ip,counter,mask): parts = ip.split('.') if len(parts)!=4: counter[5]+=1 try: nums = [int(p) for p in parts] ex...

2025-07-14

0 30

题解 | 识别有效的IP地址和掩码并进行分类统计

def is_valid_ip(ip,counter,mask): parts = ip.split('.') if len(parts)!=4: counter[5]+=1 try: nums = [int(p) for p in parts] ex...

2025-07-14

0 44

题解 | 购物单

from collections import defaultdict money,amount = map(int,input().split()) main_items = [] atta_items = defaultdict(list) dp = [0]*(money+1) for i in...

2025-07-13

0 38

题解 | 田忌赛马

import sys v = list(map(int,sys.stdin.readline().split())) a = list(map(int,sys.stdin.readline().split())) flag = [0]*len(v) visited = [False for _ in...

2025-06-21

0 53

题解 | 蛇形矩阵

n = int(input()) matrix = [[0 for _ in range(n)] for _ in range(n)] k = 1 for sum_idx in range(2 * n - 1): if sum_idx % 2 == 0: # 从下往上遍历对角...

2025-06-19

0 36

题解 | 超级圣诞树

n = int(input()) max_width = 5*(2**(n-1))+2**(n-1)-1 level = 3 line = ['*','* *','* * *'] for i in range(1,n): for j in range(level): spa...

2025-06-17

0 122

题解 | 圣诞树

n = int(input()) max_width = 6*n-1 for i in range(3*n): if i%3 == 0: line = '*' elif i%3 == 1: line = '* *' else: ...

2025-06-17

0 32