约瑟夫问题（遇三杀人）

约瑟夫问题

list1 = [i for i in range(1,40)]
print(list1)

[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]

k = 0
while len(list1)>2 :
    i = 0
    while i<len(list1):
        k += 1
        if k == 3:      # 遇3杀人 
            list1.remove(list1[i])
            k =0 
        else:
            i +=1
print(list1)

[10, 25]

def yue(x,y,z):				# x是人数，y是遇y淘汰，z是幸存人数
    list1 = [i for i in range(1,x+1)]
    k = 0
    while len(list1)>z :
        i = 0
        while i<len(list1):
            k += 1
            if k == y:      
                list1.remove(list1[i])
                k =0 
            else:
                i +=1
    result = list1
    return result

def move(players,step):
    # 移动step前的元素到列表末尾
    num = step - 1
    while num > 0:
        tmp = players.pop(0)
        players.append(tmp)
        num = num - 1
    return players # 根据step做了元素的移动
def play(players,step,alive): 
#生成一个列表，从[1,...,players]
    list1 = [i for i in range(1,players+1)]

#进入游戏的循环，每次数到step淘汰，step之前的元素移动到列表末尾
#游戏结束的条件：列表剩余人数小于alive


    # 移动step前的元素到列表末尾
    while len(list1)>alive:
        list1 = move(list1,step)           
        list1.pop(0)
    
    return list1
players_num = int(input("请输入参加游戏的人数"))
step_num = int(input("请输入淘汰的数字"))
alive_num = int(input("请输入幸存人数"))

alive_list = play(players_num,step_num,alive_num)
print(alive_list)