Question: c++ code please 5. In an ancient land, the beautiful princess Eve had many suitors. She decided on the following procedure to determine which suitor

 c++ code please 5. In an ancient land, the beautiful princess

c++ code please

5. 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 Programming Projects 317 suitor would be number 1, the second number 2, and so on up to the last suitor number n. Starting at the first suitor she would then count three suitors dowrn the line (because of the three letters in her name) and the third suitor would be eliminated from winning her hand and removed from the line. Eve would thern continue, counting three more suitors, and eliminating 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 12456 1245 125 15 initial list of suitors, start counting from 1 suitor 3 eliminated, continue counting from 4 suitor 6 eliminated, continue counting from 1 suitor 4 eliminated, continue counting from5 suitor 2 eliminated, continue counting from 5 suitor 5 eliminated, 1 is the lucky winner that uses a vector to determine which position you should stand Write a program in to marry the princess if there are n suitors. You will find the following function from the Vector class useful: v.erase (iter); // Removes element at position iter For example, to use this function to erase the fourth element from the beginning of a vector variable named theVector, use thevector.era se{thevector . begin{ 3); + The number 3 is used because the first element in the vector is at index position 0

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!