Each entry in the table is a single char. The only values allowed are the digits $0-9$ and the chars

A$-$Z $/$ a$-$z$.$ We will use $$ or $*$ to designate a blank square.

We consider only $$square$$ puzzles. Puzzles that have a number of entries that is a perfect square

are processed and displayed; puzzles that do not have a number of entries that is a perfect square

are rejected. Pro tip: read the entire file into a vector of characters, then check the size. If it$$s a

perfect square, create your square table $($a two$-$dimensional array$)$ and copy the values

$($converting from char to the associated integer value$)$ from the vector into the table.

For example, the input file to the left would be displayed as the puzzle to the right.

A $3$ B $-10311$

$12341234$

C A F E $12101514$

$0-2$ C $0212$

This conversion of char to int will be of great use to us in the next unit, when we explore how

recursion can be used to solve number puzzles such as Sudoku and Numbrix and Magic Square