The Josephus Problem In programming C

The Josephus Problem, People are standing in a circle waiting to be executed. Counting begins at a specified point in the circle and proceeds around the circle in a specified direction. After a specified number of people are skipped, the next person is executed. The procedure is repeated with the remaining people, starting with the next person, going in the same direction and skipping the same number of people, until only one person remains, and is freed. The problem - given the number of people, starting point, direction, and number to be skipped - is to choose the position in the initial circle to avoid execution.

Instead of using bit-manipulating operations, implement your program by using an array to represent the circle of soldiers and loop and conditional constructs to "simulate" the counting-out game.

The out put should look like:

How many people are in the circle?: 41

The spot 19 is safe.