[Crossword Answers UVA - 232 ]

最新推荐文章于 2021-12-29 09:52:52 发布

dazhangyu97

最新推荐文章于 2021-12-29 09:52:52 发布

阅读量274

点赞数

分类专栏： UVA-OJ 文章标签： uva c

本文链接：https://blog.csdn.net/dazhangyu97/article/details/78233633

版权

UVA-OJ 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Crossword Answers UVA - 232

#include <string.h>
#include <stdio.h>
//#define LOCAL
char s[12][12];
int num[12][12];
int main()
{
    int cases = 0;

#ifdef LOCAL
    freopen("test.txt", "r", stdin);
#endif
    int r, c;
    while (scanf("%d %d", &r, &c) == 2) {
        memset(num, 0, sizeof(num));
        for (int i = 0; i < r; ++i)
            scanf("%s", s[i]);
        int m = 1;
        //mark the num
        for (int i = 0; i < r; ++i) {
            for (int j = 0; j < c; j++) {
                if (s[i][j] == '*')
                    continue;
                if (i == 0 || s[i - 1][j] == '*' || j == 0 || s[i][j - 1] == '*')
                    num[i][j] = m++;
            }
        }

        if (cases) printf("\n");
        printf("puzzle #%d:\nAcross\n", ++cases);
        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c;) {
                if (num[i][j] == 0 || s[i][j] == '*') {
                    ++j;
                    continue;
                }
                printf("%3d.", num[i][j]);
                while (j < c && s[i][j] != '*') {
                    putchar(s[i][j]);
                    ++j;
                }
                printf("\n");
            }
        }
        printf("Down\n");
        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; ++j) {
                if (num[i][j] == 0 || s[i][j] == '*')
                    continue;
                printf("%3d.", num[i][j]);
                int k = i;
                while (k < r && s[k][j] != '*') {
                    putchar(s[k][j]);
                    num[k][j] = 0;
                    ++k;
                }
                printf("\n");
            }
        }
    }
    return 0;
}

属于模拟题，要控制好相关语句的输出顺序，以及，num[i][j]=0很重要！