aljjw

题解

/ 注册

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

题解 | #又放学辣（简单）#

N,M,K=map(int,input().split()) t=map(int,input().split()) b = Counter(t) for i in range(1, M+1): t = [b[j] for j in range(1, M+1)] t.pop(i-1)...

Python3 哈希表模拟

2023-11-12

0 280

题解 | #Kevin is Counting Stars#

a.sort() res = 0 for i in range(1, n - 1): res += a[i] if a[1] < a[n-1]: res += 1 return res t=int(input()) for i i...

Python3

2023-11-12

0 285

题解 | #第一次放学#

n,m,k=map(int,input().split()) a=sorted(Counter(map(int,input().split())).values()) for i in range(len(a)): if a[i]>=k: a[i]=a[i]-k ...

Python3 数组

2023-11-12

0 259