表示全排列 | HJ27 查找兄弟单词

import itertools
while True:
    try:
        s = input().split()
        n, words, word, inx = s[0], s[1:-2], s[-2].strip(), int(s[-1])
        # permu = list(itertools.permutations(word, len(word)))
        # bros = [w for w in words if tuple(w) in permu and w!=tuple(word)]
        bros=[]
        for i in words:
            if len(i)==len(word) and i!=word and sorted(i)==sorted(word):
                bros.append(i)
        sort_bros = sorted(bros)
        print(len(bros))
        print(''.join(sort_bros[inx-1]))

    except:
        break

用时：35min