ill__

题解

/ 注册

全部文章 / 题解（共16篇）

题解 | #构造A+B#

n,k =map(int,input().split()) #共有n-1对，如果n-1比k大就满足题意 if n-1>=k:print('YES') else:print('NO')

2025-10-06

1 8

题解 | #小紫的劣势博弈#

n = int(input()) a = list(map(int,input().split())) a.sort() cnt=0 for i in range(n): if&nb...

2025-10-04

1 11

题解 | #小红抽卡#

n, k, x = map(int, input().split()) a = list(map(int, input().split())) # 前x张牌 front = a[:x] b...

2025-10-04

1 9

题解 | #Kato_Shoko#

from collections import Counter target = "Kato_Shoko" n = int(input()) s = input().strip() target_counter = Counter(target) s_counter = Counter(s) for...

2025-10-03

1 11

题解 | #小红的数组选数#

from collections import Counter target = "Kato_Shoko" n = int(input()) s = input().strip() target_counter = Counter(target) s_counter = Counter(s) for...

2025-10-03

1 8

题解 | #拼数#

自我思考：比较每一个整数的首位，大的放前面，若第一个数相等则比较第二位 but借鉴 #include #include //#include<bits/stdc++.h> using namespace std; bool cmp(string a,string b){ return a...

2025-01-05

1 55