In an ancient land, the beautiful princess Eve had many suitors. She decided on the following procedure to determine which suitor she would marry, first, all of the suitors would be lined up one after the other and assigned numbers. The first suitor would be number 1, die second number 2, and so on up to the last suitor, number n. Starting at the first suitor she would then count three suitors down the line (because of die three letters in her name) and the third suitor would be eliminated from winning her hand and removed from the line. Eve would then continue, counting three more suitors, and eliminate every third suitor. When she reached the end of the line she would continue counting from the beginning.
For example, if there were six suitors then the elimination process would proceed as follows:
123456 initial list of suitors, start counting from 1
12456 suitor 3 eliminated, continue counting from 4
1245 suitor 6 eliminated, continue counting from 1
125 suitor 4 eliminated, continue counting from 5
Write a program that creates a circular linked list of nodes to determine which position you should stand in to many die princess if there are n suitors. A circular linked list is a linked list where die link field of die last node in the list refers to the node that is the head of the list. Your program should simulate die elimination process by deleting die node that conesponds to die suitor that is eliminated for each step in the process. Consider the possibility that you may need to delete die “head” node in die list.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.