12门徒问题（即约瑟夫环）

def next_one((lista,indexb)):
if len(lista)-1>indexb:
return (lista,indexb+1)
return (lista,0)

def j(n,m):
a=[]
for i in range(1,n+1):
a.append(i)
count = (a,0)
while len(a)>1:
for y in range(1,m):
count = next_one(count)
a.remove(a[count[1]])
return a[0]