【高级技巧】约瑟夫环：循环淘汰的顺序求解封装

local function survivor(n, m)
    local pos = 0
    for i = 2, n do
        pos = (pos + m) % i
    end
    return pos + 1
end
local function outOrder(n, m)
    local circle = {}
    for i = 1, n do
        circle[i] = i
    end
    local order = {}
    local idx = 0
    while #circle > 0 do
        idx = (idx + m - 1) % #circle
        order[#order + 1] = table.remove(circle, idx + 1)
    end
    return order
end
print(survivor(41, 3))
local order = outOrder(5, 3)
for i, who in ipairs(order) do
    print("第" .. i .. "个出局：" .. who)
end

local alive = circle[1]
print("末位幸存者：" .. alive)