Enigmatics |
|
Posted on: Thursday 17/1, 2008; 3:43 PM Define the names of the people.
Define the landing and departure times. Create a list of all possible landing and departure times, where a single case has the format {landings:{hw1, hw2, hw3}, departures:{hw1, hw2, hw3}} = {{{lh1,lw1}, {lh2,lw2}, {lh3,lw3}}, {{dh1,dw1}, {dh2,dw2}, {dh3,dw3}}}. In order to limit the size of the list it is immediately constrained to enforce the landing times of each husband-wife pair to be exactly as defined.
Construct a list of all possible alternative departure times in which husbands and wives are paired up in all possible ways (!). Extract the set of cases that fit the above alternatives.
Extract the cases in which all the people had different waiting times. There are only 2 possibilities. Compute the waiting times for these 2 cases. For each of the 2 cases compute the number of husbands who waited for a shorter time than their wives. This tells us that the first case is the one for which more than one husband had a shorter wait than his wife. For the first case compute the ordering of the waiting times. List the names in the order given by the above ordering. This is the required solution. |
Blogged from |
||||
