Problem C: Square Letter Puzzles Joe Coder is preparing a mobile app with a letter puzzle game. Each puzzle piece in his game consists of four letters arranged in a square, such as AB CD He decided to use only uppercase letters and the underscore ('_') character in his puzzles. Addi tionally, he wants to arrange these puzzle pieces into larger square patterns. For example, if you we are given the following four pieces presented in a linear order: AB AA XY OP CD he will need to rearrange them into the pattern: AB AA CD XY OP Your task is to write a program for rearranging the pieces from the linear order into a square pattern. You must follow the same order of pieces, with pieces going row by row in the pattern. Input The input consists of one or more test cases. Each test case starts with an integer n* on a line (n2 > 0), which is the number of puzzle pieces. This is followed by two lines containing letters of the puzzle pieces. The first line contains top letters and the second line contains bottom letters of the pieces. Letters of one piece are separated from the letters of the next piece with one space character. The input ends with the number 0 Output For each test case, you first must print the line New puzzle (n x n): with n xn being the puzzle dimensions, followed by the puzzle pieces arranged into a square. You should take a look at the sample output for the exact format. Horizontal pieces are separated by a Problem C: Square Letter Puzzles Joe Coder is preparing a mobile app with a letter puzzle game. Each puzzle piece in his game consists of four letters arranged in a square, such as AB CD He decided to use only uppercase letters and the underscore ('_') character in his puzzles. Addi tionally, he wants to arrange these puzzle pieces into larger square patterns. For example, if you we are given the following four pieces presented in a linear order: AB AA XY OP CD he will need to rearrange them into the pattern: AB AA CD XY OP Your task is to write a program for rearranging the pieces from the linear order into a square pattern. You must follow the same order of pieces, with pieces going row by row in the pattern. Input The input consists of one or more test cases. Each test case starts with an integer n* on a line (n2 > 0), which is the number of puzzle pieces. This is followed by two lines containing letters of the puzzle pieces. The first line contains top letters and the second line contains bottom letters of the pieces. Letters of one piece are separated from the letters of the next piece with one space character. The input ends with the number 0 Output For each test case, you first must print the line New puzzle (n x n): with n xn being the puzzle dimensions, followed by the puzzle pieces arranged into a square. You should take a look at the sample output for the exact format. Horizontal pieces are separated by a
