UVA - 232 Crossword Answers

UVA - 232 Crossword Answers

---

#include"stdio.h"
#include"string.h"
char map[10][10];
int flag[10][10];
int h, w;
int times;
void input()
{
    getchar();
    for (int i = 0; i < h; ++i)
    {
        for (int j = 0; j < w; ++j)
            scanf("%c", &map[i][j]);
        getchar();
    }
}
bool check(int i, int j)
{
    if (map[i][j] == '*')return false;
    if (i == 0 || j == 0)return true;
    if (map[i - 1][j] == '*' || map[i][j - 1] == '*')return true;
    return false;
}
void find()
{
    int k = 0;
    for (int i = 0; i < h; ++i)
        for (int j = 0; j < w; ++j)
            if (check(i, j))
                flag[i][j] = ++k;
}
void output()
{
    printf("puzzle #%d:\n", times);
    printf("Across\n");
    for(int i=0;i<h;++i)
        for(int j=0;j<w;++j)
            if (flag[i][j])
            {
                printf("%3d.", flag[i][j]);
                while (map[i][j] != '*'&&j < w)
                {   
                    printf("%c", map[i][j]);
                    ++j;
                }
                printf("\n");
            }
    printf("Down\n");
    for (int i = 0; i < h; ++i)
        for (int j = 0; j < w; ++j)
            if (flag[i][j] && (i == 0 || (i != 0 && map[i - 1][j] == '*')))
            {
                printf("%3d.", flag[i][j]);
                int k = 0;
                while (map[i + k][j] != '*'&&i + k < h)
                {
                    printf("%c", map[i + k][j]);
                    ++k;
                }
                printf("\n");
            }
}
int main()
{
    times = 0;
    while (++times)
    {
        memset(map, 0, sizeof(map));
        memset(flag, 0, sizeof(flag));
        scanf("%d", &h);
        if (h == 0)break;
        if (times != 1)printf("\n");
        scanf("%d", &w);
        input();
        find();
        output();
    }
    return 0;
}