Joseph-problem

代码说明：

  有N个小孩围坐成一个圆，从某个小孩开始顺序报数，报到M的小孩从圈子中离开， 从下一个小孩重新开始报数。每报到M相应的小孩从圈子离开， 最后一个离开圈子的小孩为胜者。 (N children sitting in a circle, the start sequence from one child reported the number to report child of M from the circle to leave and re-start from the next child reported number. Registration M corresponding child away from the circle, the last child to leave the circle for the winner.)