一班有m 个女生,有n 个男生（m 不等于n ），现要开一个舞会。男女生分别编号坐在舞池的两边的椅子上。每曲开始时，依次从男生和女生中各出一人配对跳舞，本曲没成功配对者坐着等待下一曲找舞伴。

请设计一系统模拟动态地显示出上述过程，要求如下：

（1）输出每曲配对情况；

（2 ）计算出任何一个男生（编号为X ）和任意女生（编号为Y ），在第K 曲配对跳舞

的情况.至少求出K 的两个值

分别用循环队列和链队列实现了 -A group of girls with m, there are n boys (m not equal to n), is to open a dance. Number of boys and girls were sitting in a chair on either side of the dance floor. The beginning of each song, followed by boys and girls from out of one pair of each dance, the song did not match the success of those who sit and wait for the next one to find partners. Please design a dynamic system simulation shows that the above process, the following: (1) pair of output for each song　(2) to calculate any of the boys (number of X) and any girls (numbered Y), K in the first song dance matching the case, at least two values ​ ​ of K were obtained with the circular queue and the queue chain to achieve a