【Uva 232】 Crossword Answers

Description

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 across 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.)

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 above 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 across white squares of the first row, then across the eligible white squares of the second row, then across the eligible white squares of the third row and so on across all of the rest of the rows of the puzzle. The picture below illustrates a rectangular crossword puzzle grid with appropriate numbering.

An “across” 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 across 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 across and down words which constitute the solutions

Input

Each puzzle solution in the input starts with a line containing two integers r and c (1≤r≤10,1≤c≤10) , where r (the first number) is the number of rows in the puzzle and c (the second number) is the number of columns.

The r rows of input which follow each contain c characters (excluding the end-of-line) which describe the solution. Each of those c characters 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 across 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 across 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), the Across and Down headings should still appear.

Separate output for successive input puzzles by a blank line.

Sample Input

2 2
AT
*O
6 7
AIM*DEN
*ME*ONE
UPON*TO
SO*ERIN
SA*OR
IES*DEA
0

Sample Output

puzzle #1:
Across
1.AT
3.O
Down
1.A
2.TO

puzzle #2:
Across
1.AIM
4.DEN
7.ME
8.ONE
9.UPON
11.TO
12.SO
13.ERIN
15.SA
17.OR
18.IES
19.DEA
Down
1.A
2.IMPOSE
3.MEO
4.DO
5.ENTIRE
6.NEON
9.US
10.NE
14.ROD
16.AS
18.I
20.A

解题思路

【grid】格子
【sequential】按次序的，连续的
【eligible】合法的
【consecutively】连续

背景为填字游戏，先输出横着的单词，再输出竖的，要求按编号从小到大输出。
编号部分：根据当前字符的左边或上边是否也为”*”来决定是否编号
输出部分：按行输出可以保证编号从小到大。逐个扫描，判断是否有连续的“*”来决定输出与否。

参考代码

#include <stdio.h>#include <string.h>int main(){    char last_c1,last_c2,s[15][15];    int r,c,i,j,k,kase = 0,num,m[15][15]={0};    while(~scanf("%d%d",&r,&c) && r){        getchar();        memset(s,'*',sizeof(s)); //棋盘全部初始化为“*”        memset(m,0,sizeof(num));        for (i = 1;i <= r;i++){            for (j = 1;j <= c;j++)                scanf("%c",&s[i][j]);//读入棋盘            getchar();        }        num = 0;        for (i = 1;i <= r;i++){//标记数字            last_c1 = '*';            last_c2 = s[i-1][1];            for (j = 1;j <= c;j++){                if ((last_c1 == '*' && s[i][j] != '*') || (last_c2 == '*' && s[i][j] != '*'))//先判断横的，再判断竖的                //last_c1是s[i][j]左边的字符，last_c2是s[i][j]上边的字符                    m[i][j] = ++num;                last_c1 = s[i][j];//更新字符                last_c2 = s[i-1][j+1];//同上            }           }        if (kase)            putchar('\n');        printf("puzzle #%d:\n",++kase);        printf("Across\n");        for (i = 1; i <= r; i++)             for (j = 1; j <= c; j++)                if (s[i][j] != '*' && s[i][j-1] == '*'){                    printf("%3d.", m[i][j]);//输出标号                    for (k = j;s[i][k] != '*';k++)//从第一个非“*”一直输出到“*”为止                        putchar(s[i][k]);                    putchar('\n');                }               printf("Down\n");        for (i = 1; i <= r; i++) //同上，注意标号也要从小到大输出，因此还是要以行来扫描，不能因为是 “Down”就扫描列！            for (j = 1; j <= c; j++) {                if (s[i][j] != '*' && s[i-1][j] == '*') {                    printf("%3d.", m[i][j]);                    for (k = i;s[k][j] != '*'; k++)                 putchar(s[k][j]);                putchar('\n');            }        }    }    return 0;}