约瑟夫问题

这是17世纪的法国数学家加斯帕在《数目的游戏问题》中讲的一个故事：15个*和15 个非*在深海上遇险，必须将一半的人投入海中，其余的人才能幸免于难，于是想了一个办法：30个人围成一圆圈，从第一个人开始依次报数，每数到第九个人就将他扔入大海，如此循环进行直到仅余15个人为止。问怎样排法，才能使每次投入大海的都是非*。

含C语言大报告-Josephus problem which is the 17th-century French mathematician Gaspard in the " number of games Problems"　tell a story: 15 Protestants and 15 non-believers on the deep distress, half of the people must be put into the sea, and the rest in order to survive, so the thought of a way: 30 individuals have formed a circle, started from the first turn reported the number of individuals per count to the ninth he will be thrown into the sea, so the loop until you are down to 15 people so far . Q. How permutation in order to make each into the sea are non-believers. The report containing the C language