Fill the Square
来源:互联网 发布:php class实例化 编辑:程序博客网 时间:2024/06/05 17:10
中文题目解释详见我的博客:http://xiaoshig.sinaapp.com/?p=94
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:
- Make sure no adjacent cells contain the same letter; two cells are adjacent if they share a common edge.
- 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.
OutputFor 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
Problemsetter: Sohel Hafiz
#include<iostream>using namespace std;int main(){char a[15][15],ch;bool l;int n,i,t,j,k;cin>>t;for(k=1;k<=t;k++){cin>>n;for(i=0;i<n;i++)cin>>a[i];for(i=0;i<n;i++) for(j=0;j<n;j++) if(a[i][j]=='.') {for(ch='A';ch<='Z';ch++){l=1;if(i>0&&a[i-1][j]==ch)l=0;if(i<n-1&&a[i+1][j]==ch)l=0;if(j>0&&a[i][j-1]==ch)l=0;if(i<n-1&&a[i][j+1]==ch)l=0;if(l){a[i][j]=ch;break;}} }cout<<"Case "<<k<<':'<<endl;for(i=0;i<n;i++){for(j=0;j<n;j++)cout<<a[i][j];cout<<endl;}}return 0;}
- 11520 - Fill the Square
- 11520 - Fill the Square
- Fill the Square
- uva11520 Fill the Square
- uva11520 Fill the Square
- Fill the Square
- Uva11520 - Fill the Square
- 11520 - Fill the Square
- uva11520 - Fill the Square
- Fill the Square
- uva11520 Fill the Square
- UVa11520-Fill the Square
- uva11520 Fill the Square
- Fill the Square UVA
- UVA 11520 - Fill the Square
- uva 11520 - Fill the Square
- uva 11520 Fill the Square
- Uva-11520-Fill the Square
- NO7 显式的终结方法
- poj1976 A Mini Locomotive
- const限定修饰符用法总结(常量,指针,迭代器,函数参数,成员函数)
- Python(1)
- PDF中的内嵌字体问题
- Fill the Square
- Ajax之旅(二)--XMLHttpRequest
- poj 1094 Sorting It All Out
- 【HDU】4869 Turn the pokers 组合数
- hdu 1532 Drainage Ditches 最大流 水题
- 转载:跟我一起写Makefile
- 上传应用时查看是否网络有问题
- TOJ English Training of ALPCs 错排列
- 在项目中导入import javax.servlet 出错解决办法