Description: In a grid divided into the playground, n soldiers stood scattered points on the grid. Grid point by the integer coordinates (x, y), said. Soldiers along the edge of the grid, down, left and right moving step, but at the same time any point on the grid can only be a soldier. In accordance with the orders of officers, the soldiers should be neatly列成level queue, that is arranged in (x, y), (x+1, y), ..., (x+ n-1, y). How to choose the value of x and y in order to enable the soldiers to a total of at least moves one line up.
To Search:
File list (Check if you may need any files):
shibingzhandui.txt