ill__

分类

题解(19)

/ 注册

全部文章（共21篇）

题解 | #构造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

题解 | #【模板】静态区间和（前缀和）#

#include<bits/stdc++.h> using namespace std; using ll=long long; ll a[1000005],b[1000005]; int main(){ int n,q; cin>>n>>q; ...

2024-12-06

1 54

题解 | #游游的整数切割#

#include<bits/stdc++.h> using namespace std; int main(){ string s; cin>>s; int n=s.length(); int sum=0; for(int i=0;i&...

2024-11-21

1 57

题解 | #游游的数字圈#

#include<bits/stdc++.h> using namespace std; int main(){ string s; cin>>s; int sum=0; int n=s.size(); for(int i=0;i<...

2024-11-21

1 60

题解 | #小美的因子查询#

#include<iostream> using namespace std; int main(){ int n,a[100005]; cin>>n; for(int i=1;i<=n;i++) cin>>a[i];...

2024-11-21

1 62