在一个装满财宝的屋子里，有2N个盒子排成一排，除了两个相邻的空盒外，其余的每个盒子里都装有一个金球或银球，总共有N-1个金球和N-1个银球。下面是一个N=5的列子 ，G表示金球，S表示银球。
In a room full of treasure, there are 2N a box in a row, but two adjacent empty box, the rest of each box is equipped with a golden goal or silver balls, a total of N-1 pieces of golden N-1 ball and a silver ball. The following is an N = 5 of Liezi, G that golden goal, S said that silver ball. (2010-07-28, Pascal, 1KB, 下载3次)