cs301 solution 1

The Josephus problem is the following mass suicide "game": n people, numbered 1 to n, are sitting in a circle. Starting at person 1, a handgun is passed. After m passes, the person holding the gun commits suicide, the body is removed, the circle closes ranks, and the game continues with the person who was sitting after the corpse picking up the gun. The last survivor is tried for n - 1 counts of manslaughter. Thus, if m = 0 and n = 5, players are killed in order and player 5 stands trial. If m = 1 and n = 5, the order of death is 2, 4, 1, 5.

Write a C++ program to solve the Josephus problem for general values of m and n using circular linked list data structure.

Input:

• Number of People: n
• Number of Passes: m

Output:

• Order in which people are removed
• The survivor

Sample Run:

Enter total number of People playing the game: 10

Enter number of Passes: 3

----------------------------------------------------

Game Started!

----------------------------------------------------

à Person removed: 4

à Person removed: 8

à Person removed: 2

à Person removed: 7

à Person removed: 3

à Person removed: 10

à Person removed: 9

à Person removed: 1

à Person removed: 6

----------------------------------------------------

ààà The survivor is : 5

----------------------------------------------------