uva 11520 - Fill the Square(贪心+枚举）

题目大意：给出一张图，'.'的地方要用大写字母去填，要求说每个位置的上下左右如果存在的话所填的字母不能和当前位置相同。输出从上到下，从左到右字典序最小的方案。

解题思路：从上到下，从左到右开始枚举，每次碰到'.'就从‘A’开始检测直到可以填入为止。

#include <cstdio>#include <cstring>int main() {int T, kase = 0;scanf("%d", &T);while (T--) {int n;char grid[15][15];scanf("%d", &n);for (int i = 0; i < n; i++)scanf("%s", grid[i]);for (int i = 0; i < n; i++)for (int j = 0; j < n; j++) {if (grid[i][j] == '.')for (char c = 'A'; c <= 'Z'; c++) {bool ok = true;if (i > 0 && grid[i-1][j] == c)ok = false;if (i < n - 1 && grid[i+1][j] == c)ok = false;if (j > 0 && grid[i][j-1] == c)ok = false;if (j < n - 1 && grid[i][j+1] == c)ok = false;if (ok) {grid[i][j] = c;break;}}}printf("Case %d:\n", ++kase);for (int i = 0; i < n; i++)printf("%s\n", grid[i]);}return 0;}