模拟Josephus问题，编写算法实现击鼓传花。-Analog Josephus problem, write algorithm drum transfer flowers.

打印金字塔形的星花，单用的算法是递归的形式。利用这个程序，可以理解递归。-Print pyramid-shaped flowers, alone in the form of the algorithm is recursive. Using this program, you can understand recursion.

所谓的带花树算法就是，把整个圈缩成一个点，Edmonds称这个超级点为“花”，就是说，原圈里的所有点都作为外点，然后继续搜索。再之后的过程中，已经被缩的点还可能被嵌套地收缩。 当我们找到一条增广路之后，还要把路上的“花”展开。 总之，带花树的算法思想就是缩点-继续找增广路-找到之后把花展开。 这个算法的思想并不难理解、难的是实现。 -The algorithm is called with trees and flowers, the whole circle shrunk t

啊收到尽快发给ask了放假啦可是对方；乐趣啊可了(There is a park near my home.There are a lot of beautiful trees,flowers and birds in the park.So many people go to the park to enjoy their weekends.They like walking or having a picnic in the park.But I like flying a kite wit