UVA11520 Fill the Square 枚举

最新推荐文章于 2020-02-01 18:16:00 发布

cnyali_ljf

最新推荐文章于 2020-02-01 18:16:00 发布

阅读量527

点赞数 1

分类专栏： uva 文章标签： UVa cpp入门

本文链接：https://blog.csdn.net/cnyali_ljf/article/details/52336508

版权

cpp入门同时被 2 个专栏收录

4 篇文章 0 订阅

订阅专栏

uva

3 篇文章 0 订阅

订阅专栏

废话不多说，直接上代码

/*************************************************************************
    > File Name: \LJF\UVa\UVa_11520.cpp
    > Author: ljf_cnyali
    > Mail: 2724424647@qq.com
    > Last modifiedz: 2016-08-27 18:43
    > Description: This is a large group of God's program information.
 ************************************************************************/

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<ctime>
#include<algorithm>
#include<queue>
#include<set>
#include<ctime>

using namespace std;

#define REP(i, a, b) for(int i = (a), _end_ = (b);i <= _end_; ++i)

const int maxn = 20;

char map[maxn][maxn];

int main() {
    int n, m;
    scanf("%d", &m);
    int t = m;
    while(m--) {
        scanf("%d", &n);
        REP(i, 1, n) {
            getchar();
            REP(j, 1, n)
                scanf("%c", &map[i][j]);
        }
        REP(i, 1, n)
            REP(j, 1, n)
                if(map[i][j] == '.')
                    REP(c, 'A', 'Z') {
                        if(i < n && c == map[i + 1][j])
                            continue;
                        if(i > 1 && c == map[i - 1][j])
                            continue;
                        if(j < n && c == map[i][j + 1])
                            continue;
                        if(j > 1 && c == map[i][j - 1])
                            continue;
                        map[i][j] = c;
                        break;
                    }
        printf("Case %d:\n", t - m);
        REP(i, 1, n) {
            REP(j, 1, n)
                printf("%c", map[i][j]);
            puts("");
        };
    }
    return 0;
}