Students with the problem   There are m girls, there are n boys (m is not equal to n), is to open a ball.The boys and girls were numbered sitting on both sides of the dance floor of the chair.At the beginning of each song, followed by boys and girls the out One pairing dancing, the song did not successfully match the next sit and wait for partners to find partners.     Please design a system simulation to dynamically show the above process, the requirements are as follows: 1) Output each song pairing 2) Calculate the number of any boys (numbered X) and any girls (number Y), and dance in the k-th pair. 3) try to design a variety of algorithms and procedures, as appropriate, plus points   Hint: It is convenient to use queue to solve.

123.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．