Ticket problem: there are 2 n people line up to buy a commodity price is 0.5 yuan, half of them took a piece of 1 RMB, take a 0.5 yuan RMB, the other to make the salesman in the sales, don't change difficulties occur, ask how the 2 n individual should line up? Find all queuing scheme, (salesman a not ready to start the change)

CodePudding user response:

The design idea and algorithm