# UVa 11520 填充正方形

In this problem, you have to draw a square using uppercase English Alphabets.

To be more precise, you will be given a square grid with some empty blocks and others already filled for you with some letters to make your task easier. You have to insert characters in every empty cell so that the whole grid is filled with alphabets. In doing so you have to meet the following rules:

1. Make sure no adjacent cells contain the same letter; two cells are adjacent if they share a common edge.
2. There could be many ways to fill the grid. You have to ensure you make the lexicographically smallest one. Here, two grids are checked in row major order when comparing lexicographically.

Input
The first line of input will contain an integer that will determine the number of test cases. Each case starts with an integer n( n<=10 ), that represents the dimension of the grid. The next n lines will contain n characters each. Every cell of the grid is either a ‘.’ or a letter from [A, Z]. Here a ‘.’ Represents an empty cell.

Output
For each case, first output Case #: ( # replaced by case number ) and in the next n lines output the input matrix with the empty cells filled heeding the rules above.

Sample Input                       Output for Sample Input

 2 3 ... ... ... 3 ... A.. ... Case 1: ABA BAB ABA Case 2: BAB ABA BAB

#include <iostream>
using namespace std;

#define MAXN 15

char grid[MAXN][MAXN];

int main()
{
int T, n;
cin>>T;
int cas = 1;
for (int k = 0; k < T; k++)
{
cin>>n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin>>grid[i][j];

for (i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (grid[i][j] == '.')
{
for (char ch = 'A'; ch <= 'Z'; ch++)//小到大
{
int flag = true;
if (i > 0 && grid[i - 1][j] == ch) flag = false;
if (i < n - 1 && grid[i + 1][j] == ch) flag = false;
if (j > 0 && grid[i][j - 1] == ch) flag = false;
if (j < n - 1 && grid[i][j + 1] == ch) flag = false;
if (flag)
{
grid[i][j] = ch;
break;
}
}
}

printf("Case %d:\n", cas ++);
for (i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
cout<<grid[i][j];
cout<<endl;

}

}
return 0;
}

• 本文已收录于以下专栏：

## Uva 11520填充正方形

#include using namespace std; char map[15][15]; int n; char min_A(int i,int j) { char a='A'; int f...
• liang5630
• 2012年11月18日 13:41
• 851

## 水题（填充正方形，uva 11520）

• xl2015190026
• 2016年10月24日 11:16
• 93

## uva11520(贪心)

• yeyeyeguoguo
• 2015年01月29日 13:01
• 401

## UVa 11520 Fill the Square 填充正方形

• FirstLucker
• 2015年07月04日 06:06
• 334

## UVa 11520 - Fill the Square （填充正方形）

Fill the Square Input: Standard Input Output: Standard Output   In this problem, you have to draw...
• u010829118
• 2013年11月25日 18:40
• 560

## 例题1.14 填充正方形 Fill the Square UVA - 11520 搜索

• lcuwb
• 2017年08月13日 15:10
• 109

## 填充正方形（Fill the Square）

Fill the Square Input: Standard Input Output: Standard Output   In this problem, you have to draw...
• Sharing_Li
• 2013年06月29日 16:12
• 739

## uva201正方形squares

• qiweigo
• 2015年02月04日 16:57
• 1439

## UVa 11520

#include #include using namespace std; int n , t; char a[20][20]; int main() { ...
• ouqingliang
• 2016年06月16日 13:54
• 169

## uva 11520

• u013392752
• 2015年01月29日 17:44
• 506

举报原因： 您举报文章：UVa 11520 填充正方形 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)