-Chessboard Coverage Problem

Algorithm Design and Analysis

Using Dev-C++

Requirements: There is a special grid in 2k2k square chessboard. At present, all parts except special grid are covered with L-shape( 3 grids) paper, and the paper cannot overlap. Please use the divide and conquer strategy to give the paper placement. Input: Linel, enter the value of k. Line2, enter x,y, that is, the abscissa and ordinate of the special grid. Output: display the coordinates of three grids of each paper in turn. Operation effect