UV 232 Crossword Answers, uv1_ssword

UV 232 Crossword Answers, uv1_ssword

Crossword Answers

A crossword puzzle consists of a rectangular grid of black and white squares and two lists of definitions (or descriptions ).

One list of definitions is for ''words "to be written left to right when SS white squares in the rows and the other list is for words to be written down white squares in the columns. (A word is a sequence of alphabetic characters .)

To solve a crossword puzzle, one writes the words corresponding to the definitions on the white squares of the grid.

 

The definitions correspond to the rectangular grid by means of sequential integers on ''eligible "white squares. white squares with black squares immediately to the left or abve them are ''eligible. "White squares with no squares either immediately to the left or above are also ''eligible. "No other squares are numbered. all of the squares on the first row are numbered.

The numbering starts with 1 and continues consecutively into SS white squares of the first row, then ss the eligible white squares of the second row, then ss the eligible white squares of the third row and so on each SS all of the rest of the rows of the puzzle. the picture below has strates a rectangular crossword puzzle grid with appropriate numbering.

 

An ''oss "word for a definition is written on a sequence of white squares in a row starting on a numbered square that does not follow another white square in the same row.

The sequence of white squares for that word goes when SS the row of the numbered square, ending immediately before the next black square in the row or in the rightmost square of the row.

 

A ''down "word for a definition is written on a sequence of white squares in a column starting on a numbered square that does not follow another white square in the same column.

The sequence of white squares for that word goes down the column of the numbered square, ending immediately before the next black square in the column or in the bottom square of the column.

Every white square in a correctly solved puzzle contains a letter.

 

You must write a program that takes several solved crossword puzzles as input and outputs the lists of parameter SS and down words which constitute the solutions.

 

Input

Each puzzle solution in the input starts with a line containing two integersRAndC(And), whereR(The first number) is the number of rows in the puzzle andC(The second number) is the number of columns.

TheRRows of input which follow each containCCharacters (excluding the end-of-line) which describe the solution. Each of thoseCCharacters is an alphabetic character which is part of a word or the character ''*", which indicates a black square.

The end of input is indicated by a line consisting of the single number 0.

 

Output

Output for each puzzle consists of an identifier for the puzzle (Puzzle #1:,Puzzle #2:, Etc .) and the list of stored SS words followed by the list of down words. words in each list must be output one-per-line in increasing order of the number of their corresponding definitions.

The heading for the list of audio SS words is''Across". The heading for the list of down words is''Down".

In the case where the lists are empty (all squares in the grid are black),AcrossAndDownHeadings shoshould still appear.

Separate output for successive input puzzles by a blank line.

Sample Input

 

2 2AT*O6 7AIM*DEN*ME*ONEUPON*TOSO*ERIN*SA*OR*IES*DEA0

 

Sample Output

 

Puzzle #1: Running SS 1.AT 3. ODown 1.A 2. TOpuzzle #2: Running SS 1.AIM 4.DEN 7.ME 8.ONE 9. UPON 11.TO 12.SO 13. ERIN 15.SA 17.OR 18.IES 19. DEADown 1.A 2. IMPOSE 3.MEO 4.DO 5. ENTIRE 6. NEON 9.US 10.NE 14.ROD 16.AS 18. I release
Pay attention to the previous number.
Attach the AC code:

1 # include <stdio. h> 2 # include <string. h> 3 # include <ctype. h> 4 5 struct As 6 {7 int x, y; 8 int Num; 9} A [1, 400]; 10 struct Dn11 {12 int x, y; 13 int Num; 14} D [400]; 15 int a, B; 16 char str [20] [20]; 17 int t1 [20] [20]; 18 int t2 [20] [20]; 19 int k; 20 int i1, i2; 21 int Flag; 22 int main () 23 {24 Flag = 1; 25 while (scanf ("% d", & )! = EOF & a) 26 {27 scanf ("% d", & B); 28 for (int I = 0; I <20; I ++) 29 for (int j = 0; j <20; j ++) 30 {31 t1 [I] [j] = 0; 32 t2 [I] [j] = 0; 33} 34 for (int I = 0; I <a; I ++) 35 scanf ("% s", str [I]); 36 for (int I = 0; I <a; I ++) 37 for (int j = 0; j <B; j ++) 38 {39 if (isalpha (str [I] [j]) 40 {41 if (I = 0 | j = 0) 42 t1 [I] [j] = 1; 43 else if (str [I-1] [j] = '*' | str [I] [J-1] = '*') 44 t1 [I] [j] = 1; 45} 46} 47 k = 0; 48 i1 = i2 = 0; 49 for (int I = 0; I <; I ++) 50 for (int j = 0; j <B; j ++) 51 {52 if (t1 [I] [j]) 53 {54 k ++; 55 t2 [I] [j] = k; 56 if (I = 0 | str [I-1] [j] = '*') 57 {58 D [i1]. num = k; 59 D [i1]. x = I; 60 D [i1 ++]. y = j; 61} 62 if (j = 0 | str [I] [J-1] = '*') 63 {64 A [i2]. num = k; 65 A [i2]. x = I; 66 A [i2 ++]. y = j; 67} 68} 69} 70 if (Flag! = 1) printf ("\ n"); 71 printf ("puzzle # % d: \ n", Flag ++); 72 printf ("audio SS \ n "); 73 for (int I = 0; I <i2; I ++) 74 {75 printf ("% 3d. ", A [I]. num); 76 for (int j = 0; j ++) 77 {78 printf ("% c", str [A [I]. x] [A [I]. y + j]); 79 if (A [I]. y + j) = b-1) break; 80 if (str [A [I]. x] [A [I]. y + j + 1] = '*') break; 81} 82 printf ("\ n"); 83} 84 printf ("Down \ n "); 85 for (int I = 0; I <i1; I ++) 86 {87 printf ("% 3d. ", D [I]. num); 88 for (int j = 0; j ++) 89 {90 printf ("% c", str [D [I]. x + j] [D [I]. y]); 91 if (D [I]. x + j) = A-1) break; 92 if (str [D [I]. x + j + 1] [D [I]. y] = '*') break; 93} 94 printf ("\ n"); 95} 96} 97 return 0; 98}View Code