Project 14. Queue Application System

At the dance hall, boys (M) and girls (N) line up in a line when they enter the ballroom. At the beginning of the dance, one person from the top of the boys' team and one from the girls' team will be assigned as partners. Unpaired people will wait for the next round of dance music. Now it is required to write an algorithm to simulate the above-mentioned dance partner problem. Assuming that a total of k songs will been danced, find the matching status of boys and girls in each song.

Enter a number t to display:

(1). The matching situation of the t-th song;

(2). All dancing partners of the t-th boy;

(3). All dancing partners of the t-th girl.

Suppose that there are N sports in Olympic Game, and each athlete can take part in 1 to 3 sports. How to arrange the competition schedule that:

(1). Sports involving the same athlete are not scheduled to take place on the same day.

(2). Make the overall competition days the minimum.

A freight train has N carriages, each of which will be parked at a different station. It is assumed that the serial numbers of N stations (from far to near) are 1-N in order, that is, freight trains pass through these stations in the order from the N-th station to the first station.

In order to facilitate the removal of the respective carriages from the train, the carriages should be arranged the same as those of the stations so that the carriages are in order from front to back, arranged 1 to N, so that only the last carriage is removed at each station.

The Brain Carriages arrive at the station at different times, so they need to be rearranged by using the Buffer Tracks, and then get out in the order of 1-N. Assuming that the amount of Buffer Track is K, it can be judged whether the train carriages arriving at the station can be rearranged successfully or not.

For example:

Suppose there are 3 Buffer Tracks, and the order of arrival of the cars is: 3,6,9,2,4,7,1,8,5, then the order of 1-N rearrangement can be completed.

If the order of arrival of the cars is: 3,6,9,2,4,7,5,8,1, then it is impossible to complete the order of 1-N rearrangement.