说明：  递归的使用 tc2.0 编译通过 24点用一笔连起来但只能用横线和竖线进行连接，最右边第二行的圆圈处不能用线进行连接 如图所示： 思路：用递归实现，设计一个递归函数tf（）进行查找下一个节点并连接以第一行第一列的点为（1，1)第二行第一列为（2，1）编好每个点的坐标，在tf函数中先查找于自身节点相邻的且可以连接的点然后进行连接，然后就以此节点为寻找下一可用结点直到tf()函数返回0，就返回。
(Up with an even 24 points but only with the horizontal and vertical lines connect the far right of the second line of the circle office can not be used to connect lines as shown: Ideas: The recursive implementation, design a recursive function tf () to find the next node and connect to the first line of the first column of the point (1,1) as the second line of the first (2,1) coordinates of each point to compiling, tf function in the first look at their adjacent nodes The connection point and can then connect, then this node can be used to find the next node until the tf () function returns 0, on the return.)