C++ / Visual Studio

The Josephus problem is a well-known game, stated as follows N people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed from one person to the next. After M passes, the person holding the hot potato is eliminated, and the circle closes ranks. The person who was sitting after the eliminated person picks up the hot potato, and the game continues. The last remaining person wins Thus, for example, if M = 0 and N = 5, players are eliminated in order, and player 5 wins. IfM 1 and N-5, the order of elimination is 2, 4, 1, 5. Write a program to solve the Josephus problem for general values of M and N. That is, it should prompt the user for M and N values, then print the sequence of elimination (as per the above examples), and the winner. You should use a list (from STL) to store the persons, and make your program as efficient as possible