Codeforces445A DZY Loves Chessboard
来源:互联网 发布:新三板 软件 编辑:程序博客网 时间:2024/05/19 06:19
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.
Input
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
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 Input
1 1.
B
2 2....
BWWB
3 3.-.-----.
B-B-----B
#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>#include <cmath>#define LL long long#define INF 0x3f3f3f3fusing namespace std;char s[110][110];int main(){ int n,m; while(cin>>n>>m) { for(int i=0; i<n; i++) { cin>>s[i]; for(int j=0; j<m; j++) { if(s[i][j] == '.') s[i][j] = 'B'; } } for(int i=0; i<n; i++) { for(int j=0; j<m; j++) { if(s[i][j] == 'B') { if( ((i+1)%2 == 0 && (j+1)%2) || ((i+1)%2 != 0 && (j+1)%2 == 0) ) s[i][j] = 'W'; } printf("%c",s[i][j]); } printf("\n"); } } return 0;}
- Codeforces445A DZY Loves Chessboard
- [CodeForces445A]DZY Loves Chessboard[bfs]
- (CF)Codeforces445A DZY Loves Chessboard(纯实现题)
- cf445A DZY Loves Chessboard
- 【CF】DZY Loves Chessboard
- DZY Loves Chessboard
- A. DZY Loves Chessboard
- dzy loves chessboard
- DZY Loves Chessboard
- 周赛-DZY Loves Chessboard
- A. DZY Loves Chessboard
- A. DZY Loves Chessboard (CF)
- CF 445A DZY Loves Chessboard
- Codeforces 445A. DZY Loves Chessboard
- Codeforces 445A DZY Loves Chessboard
- Codeforces 445A DZY Loves Chessboard(水题)
- CodeForces 445A DZY Loves Chessboard
- DZY Loves Chessboard (周赛2)
- Codeforces Round #303 Equidistant String
- Num 24 : NYOJ:0006 喷水装置 [ 贪心算法 ]
- Android基础之px,dp,sp对比以及应用
- hy8uhhui
- 装箱,拆箱&&枚举
- Codeforces445A DZY Loves Chessboard
- LotusScript查询指定字符在字符串中的位置
- ZOJ 3885 The Exchange of Items(费用流)
- Python笔记
- Socket 通信原理(Android客户端和服务器以TCP&&UDP方式互通)
- Cake (hdu 5355 构造+dfs)
- java 泛型
- android 网络框架 volley 初识
- hdu 2191 多重背包(物品的件数固定)