Description: 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
To Search:
File list (Check if you may need any files):
循环队列解决跳舞问题.CPP
链队列解决跳舞问题.CPP
Download