Steamed Stuffed Bun Algorithm

The question is a little funny. This is a question I have been thinking about recently. I 'd like to share it with you.

There is a store selling steamed stuffed buns in Tsinghua dongmen. I will not mention the brand in order to avoid advertising suspicion.

The store has the following features:

1) there is only one salesclerk. The salary of the salesclerk should be lower than that of the salesclerk.

2) There are many types of Steamed Stuffed Bun, including beef, fresh meat, Leek, Fennel, and more.

3) the working face is very limited. Three cages can be placed in front, one cage on the side, and three to four cages on the back. About 30 steamed buns can be packed in each cage.

 

The problem is very simple. Do you think that solution is better?

A: Put a steamed stuffed bun in each cage so that you don't need to search for it each time. But if you want n types of Steamed Stuffed Bun, you need to open the lid n times before closing it.

B: put various steamed stuffed buns in each cage. In most cases, you can open the lid once to meet your requirements, but a brief search process is required.

 

If you are a female clerk, what kind of solution do you use? I will announce the scheme of the salesgirl later. I think it is very reasonable.

You may think that this is not very relevant to the computer. In fact, I feel that it is related. If you think of opening a lid as a lock process (because sometimes there are two shop assistants, in addition, the integration and lock are very similar), so the low lock + little search solution is better, or the more lock + No search solution is better?

 

Please participate in thinking and answer the question.

 

Publish my answers within three days.

 

See: http://blog.csdn.net/pennyliang/archive/2010/10/14/5941452.aspx