Uva232 Crossword Answers, ACM/ICPC WordFinals 1994 算法竞赛入门经典

#include <stdio.h>
#include <ctype.h>
#include <string.h>

int main()
{
    char puzzle[10][10];
    int s[10][10];
    int ct = 0;
    int m, n;
    while(scanf("%d", &m) == 1)
    {
        if(0 == m) break;
        memset(s, 0, sizeof(s));
        scanf("%d", &n);
        int i = 0;
        while(i < m)
            scanf("%s", puzzle[i++]);

        int j, p = 1;
        for(i = 0; i < m; ++i)
        {
            for(j = 0; j < n; ++j)
            {
                if('*' == puzzle[i][j]) continue;
                if(0 == i || 0 == j) s[i][j] = p++;
                else if('*' == puzzle[i - 1][j] || '*' == puzzle[i][j - 1]) s[i][j] = p++;
            }
        }

        if(ct) printf("\n");
        printf("puzzle #%d:\n", ++ct);

        printf("Across\n");
        i = j = 0;
        while(i < m)
        {
            while(j < n)
            {
                if(s[i][j] > 0)
                {
                    printf("%3d.", s[i][j]);
                    while(j < n && puzzle[i][j] != '*')
                    {
                        putchar(puzzle[i][j++]);
                    }
                    printf("\n");
                }
                else
                    ++j;
            }
            ++i;
            j = 0;
        }

        printf("Down\n");
        i = j = 0;
        while(i < m)
        {
            while(j < n)
            {
                if(s[i][j] > 0)
                {
                    printf("%3d.", s[i][j]);
                    int x = i;
                    while(x < m && puzzle[x][j] != '*')
                    {
                        s[x][j] = 0;
                        putchar(puzzle[x++][j]);
                    }
                    printf("\n");
                }
                ++j;
            }
            ++i;
            j = 0;
        }
    }
    return 0;
}