题解 | #查找兄弟单词#
查找兄弟单词
http://www.nowcoder.com/practice/03ba8aeeef73400ca7a37a5f3370fe68
while True:
try:
s=[n for n in input().split()]
n=int(s[0])
a=s[1:-2]
target=s[-2]
k=int(s[-1])
# print(n,a,target,k)
count=0
output=[]
for i in a:
if i==target:
continue
elif sorted(i)==sorted(target):
count+=1
output.append(i)
output.sort()
print(count)
print(output[k-1])
except:
break