Please provide the sample solution for Assignment 1 CS301, its the last day today.View more random threads:
- fin622 gdb solutins fall 2011 required.
- CS501 Assignment #3
- Remote Desktop Control 2007 Full
- Drinks other than iced tea in usa and canada 2011?
- hrm624 conflict managemnet gdb last date 21 july help me...
- CS502 assignment # 2-Help needed
- CS601 Assignment#2 solution required
- CS304 Assignment No 1 STILL A MYSTERY
- why hrm is important to all managers?
- MTH001 Assignment solution January 2012
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.
Sponsored Links
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
Only few hours are left, please send it urgently.
There are currently 1 users browsing this thread. (0 members and 1 guests)