How to filter the problem difficulty wise like only of type A
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 149 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 135 |
| 7 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 132 |
How to filter the problem difficulty wise like only of type A
from collections import defaultdict
import math
def solve(a):
if len(a)<=2:
return 0
result=float("inf")
for i in "0123456789":
for j in "0123456789":
first=i
second=j
f=True
s=False
ans=""
for elements in a:
if first==elements and f:
ans+=first
f=False
s=True
elif second==elements and s:
ans+=second
f=True
s=False
if first!=second and len(ans)%2==1:
ans=ans[:-1]
result=min(len(a)-len(ans),result)
return result
for _ in range(int(input())):
a=input()
print(solve(a))
| Name |
|---|


