泊松分酒问题的一般解 用BFS进行广度优先搜索 实现简单(The general solution of Poisson's wine problem is implemented by BFS, which is simple in breadth first search)