Need different C code then what has been posted here

Problem

In this assignment, you have to simulate the Josephus problem. There are n number of prisoners standing in a circle waiting to be executed. The counting out begins at some point in the circle and proceeds around the circle in a fixed direction. In each step, a certain number of people are skipped and the next person is executed. The elimination proceeds around the circle (which is becoming smaller and smaller as the executed people are removed), until only the last person remains, who is given freedom.

Given the total number of persons n and a number k which indicates that k-1 persons are skipped and kth person is killed in circle. The task is to choose the place in the initial circle so that you are the last one remaining and so survive.

Example

For example, if n = 5 and k = 2, then the safe position is 3. Firstly, the person at position 2 is killed, then person at position 4 is killed, then person at position 1 is killed. Finally, the person at position 5 is killed. So, the person at position 3 survives.

If n = 7 and k = 3, then the safe position is 4. The persons at positions 3, 6, 2, 7, 5, 1 are killed in order, and person at position 4 survives.

Input: n and k

Output:

The position number who will survive.

Requirement:

You must use the concept of circular queue while inserting and it should be implemented using circular doubly linked list. You dont need to use front and rear as you are using linked list. Root and last node automatically handle that.

Hint: After getting the value of n, generate n numbers (1, 2, 3., , n) and insert into the doubly circular linked list. Then start deleting nodes based on the value of k until the list has only one node remaining.