1059 C语言竞赛 python

有超时,随便看看

#判断是否是素数
def isprime(num):
    if num==2:
        return True
    for k in range(2, num):
        if num % k == 0:
            return False
    if k+1==num:
        return True

#存储选手ID
player_num=int(input())

player_list=list()
for i in range(player_num):
    player=input()
    player_list.append(player)

#存储查询列表
query_num=int(input())
query_list=list()
for i in range(query_num):
    query=input()
    query_list.append(query)

#打印输出
for i in range(query_num):
    if query_list[i] not in player_list:
        print('{0}: Are you kidding?'.format(query_list[i]))
    else:
        if query_list[i] in query_list[0:i]:
            print('{0}: Checked'.format(query_list[i]))
        else:
            if player_list.index(query_list[i])==0:
                print('{0}: Mystery Award'.format(query_list[i]))
            elif isprime(player_list.index(query_list[i])+1):
                print('{0}: Minion'.format(query_list[i]))
            else:
                print('{0}: Chocolate'.format(query_list[i]))

你可能感兴趣的:(1059 C语言竞赛 python)