Start: Jul, 06, 2019 10:00:00
20190706Python程序设计基础培训扩展练习
End: Jul, 17, 2019 12:00:00
Time elapsed:
Time remaining:

Problem_ID: K
Result: Accepted
Time: 45ms
Memory: 25312kB
Author: 13336131920
In contest: 1300

def trans(m):#内部数据排序
    a = list(str(m))
    a.sort()
    b = "".join(a)
    return b

while True:
    n = int(input())
    if n==0:
        break
    s = list(map(int,input().split()))
    s1 = list(map(trans,s)) #列表s1是列表s的各个内部排过序得到
    
    s2,i =[],0
    while i<len(s1):
        if s1.count(s1[i]) == 1: #个数为1 不重复则把原串加入需要的串里面 重复 则不要 
            s2.append(s[i])#s1是s的内部排过序的 所以加入时要用s而非s1
        i = i+1
    s2.sort()
    
    if len(s2) == 0:
        print("None")
    else:
        for m in s2:
            print(m,end=" ")
        print()