DZY Loves Chessboard (周赛2)
来源:互联网 发布:gta5画面设置优化 编辑:程序博客网 时间:2024/05/25 18:11
DZY loves chessboard, and he enjoys playing with it.
He has a chessboard of n rows and m columns. Some cells of the chessboard are bad, others are good. For every good cell, DZY wants to put a chessman on it. Each chessman is either white or black. After putting all chessmen, DZY wants that no two chessmen with the same color are on two adjacent cells. Two cells are adjacent if and only if they share a common edge.
You task is to find any suitable placement of chessmen on the given chessboard.
The first line contains two space-separated integers n andm(1 ≤ n, m ≤ 100).
Each of the next n lines contains a string ofm characters: thej-th character of thei-th string is either "." or "-". A "." means that the corresponding cell (in thei-th row and thej-th column) is good, while a "-" means it is bad.
Output must contain n lines, each line must contain a string ofm characters. Thej-th character of thei-th string should be either "W", "B" or "-". Character "W" means the chessman on the cell is white, "B" means it is black, "-" means the cell is a bad cell.
If multiple answers exist, print any of them. It is guaranteed that at least one answer exists.
Sample test(s)
Input
1 1.
Output
B
Input
2 2....
Output
BWWB
Input
3 3.-.-----.
Output
B-B-----B
Note
In the first sample, DZY puts a single black chessman. Of course putting a white one is also OK.
In the second sample, all 4 cells are good. No two same chessmen share an edge in the sample output.
In the third sample, no good cells are adjacent. So you can just put 3 chessmen, no matter what their colors are.
水题 不解释 上代码。
#include <stdio.h>#include <string.h>int main(){ int n,m; char a[100][100]; while(~scanf("%d%d",&n,&m)) { int i,j; for(i=0;i<n;i++) { scanf("%s",a[i]); } for(i=0;i<n;i++) { for(j=0;j<m;j++) { if(a[i][j]=='.' && (i+j)%2==0) a[i][j]='B'; else if(a[i][j]=='.' && (i+j)%2!=0) a[i][j]='W'; } } for(i=0;i<n;i++) { for(j=0;j<m;j++) printf("%c",a[i][j]); printf("\n"); } } return 0;}
- DZY Loves Chessboard (周赛2)
- 周赛-DZY Loves Chessboard
- cf445A DZY Loves Chessboard
- 【CF】DZY Loves Chessboard
- DZY Loves Chessboard
- A. DZY Loves Chessboard
- dzy loves chessboard
- DZY Loves Chessboard
- Codeforces445A DZY Loves Chessboard
- A. DZY Loves Chessboard
- A. DZY Loves Chessboard (CF)
- [CodeForces445A]DZY Loves Chessboard[bfs]
- Codeforces Round #254 (Div. 2)445A DZY Loves Chessboard(字符串处理)
- Codeforces Round #254 (Div. 2) A. DZY Loves Chessboard
- Codeforces Round #254 (Div. 2):A. DZY Loves Chessboard
- Codeforces Round #254 (Div. 2) A. DZY Loves Chessboard
- Codeforces Round #254 (Div. 2) A. DZY Loves Chessboard
- Codeforces Round #254 (Div. 2) A. DZY Loves Chessboard
- undefined reference to ...... @GLIBCXX
- ibatis的queyrForList和queryForMap区别
- B - RGCDQ-HDU 5317-素数筛法
- poj1102+每个数字有七笔画每行扫描+注意细节每个样例后要有两个回车
- mac下显示和隐藏隐藏文件
- DZY Loves Chessboard (周赛2)
- 推荐几个机器学习算法及应用领域相关的中国大牛
- 创业要趁早
- Connection timed out: connect
- List<>与数组[]转换
- Java加密与解密的艺术-读书笔记3-4章
- Android学习下拉列表 spinner
- LeetCode(18)4Sum
- /etc/rc.d/rc.local 自动加载linux 脚本