A children’s board game consists of a square array of dots that contains lines connecting some of the pairs of adjacent dots. One part of the game requires that the players count the number of squares of certain sizes that are formed by these lines. For example, in the figure shown below, there are 3 squares — 2 of size 1 and 1 of size 2. (The “size” of a square is the number of lines segments required to form a side.) Your problem is to write a program that automates the process of counting all the possible squares. Input The input file represents a series of game boards. Each board consists of a description of a square array of n2 dots (where 2 ≤ n ≤ 9) and some interconnecting horizontal and vertical lines. A record for a single board with n2 dots and m interconnecting lines is formatted as follows: Line 1: n the number of dots in a single row or column of the array Line 2: m the number of interconnecting lines Each of the next m lines are of one of two types: Hij indicates a horizontal line in row i which connects the dot in column j to the one to its right in column j + 1 Vij indicates a vertical line in column i which connects the dot in row j to the one below in row j + 1 Information for each line begins in column 1. The end of input is indicated by end-of-file. The first record of the sample input below represents the board of the square above. Output For each record, label the corresponding output with ‘Problem #1’, ‘Problem #2’, and so forth. Output for a record consists of the number of squares of each size on the board, from the smallest to the largest. lf no squares of any size exist, your program should print an appropriate message indicating so. Separate output for successive input records by a line of asterisks between two blank lines, like in the sample below. or
2/2 Sample Input 4 16 H11 H13 H21 H22 H23 H32 H42 H43 V11 V21 V22 V23 V32 V41 V42 V43 2 3 H11 H21 V21 Sample Output Problem #1 2 square (s) of size 1 1 square (s) of size 2
Problem #2 No completed squares can be found.