第二题，拿自己以前写的约瑟夫环的代码改了改 def josephus(n, m):     p = 0     people = list(range(1, n+1))     out_list = []     i = 0     while True:         p = (p + (m-1)) % len(people)         out_list.append(people[p])         i += 1         if people[p] == people[len(people) - 1]:             print(i)             break         del people[p] n = int(input()) m = 5 josephus(n, m)