Description: 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.
To Search:
File list (Check if you may need any files):
123.cpp
Download