Deterministic pancake flipping (Al Zimmermann)	Discuss about this problem
Begin with a stack of n pancakes of radii 1 through n. Flip the topmost k pancakes, where k is the radius of the top pancake. Continue to flip pancakes in this manner until the pancake of radius 1 is on the top. For each value of n, find the stack of pancakes that maximizes the number of flips required. Submit pancakes sets which maximize the number of flips to be ordered.