约瑟夫问题详解版本已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1，最后结果+1即为原问题的解。-Joseph Detailed versions of known issues n individuals (with numbers 1,2,3 ... n, respectively) sitting around a round table. From the number of people began to report the number k, m is the number to the person out of the line　he' s gettin next person and　one number to the number m of the man was out of the line　and so the law is repeated until the round table were all out of the column. We numbered　0 ~ n-1, the final result is the solution of the original problem+1 usually solve such problems.