• [D] Fill In The Blank

  • 时间限制: 1000 ms 内存限制: 65535 K
  • 问题描述
  • Then , we have n * n grids , we get a task to let the rest of the gird to get a letter(A-Z) , and the adjacent's grid
    have different letter . Also , up to down , left to right , wo must Lexicographic ascending.
  • 输入
  • There are some cases .
    Each case has a number n (1 <= n <= 20).
    Then n lines , we get a grids ,that wo have to finish the task .
    Point:the '.' represent the grid is blank , we put a letter in it.
  • 输出
  • Print the right answer with n * n grids.
  • 样例输入
  • 3
    ...
    ...
    ...
    3
    ...
    A..
    ...
  • 样例输出
  • Case 1:
    ABA
    BAB
    ABA
    Case 2:
    BAB
    ABA
    BAB
  • 提示
  • 来源
  • Three God
  • 操作

显示春菜