Introduction - If you have any usage issues, please Google them yourself
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