codeforce 445 A
来源:互联网 发布:联想传奇电子教室软件 编辑:程序博客网 时间:2024/05/18 00:23
http://codeforces.com/problemset/problem/445/A
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 and m (1 ≤ n, m ≤ 100).
Each of the next n lines contains a string of m characters: the j-th character of the i-th string is either "." or "-". A "." means that the corresponding cell (in the i-th row and the j-th column) is good, while a "-" means it is bad.
Output must contain n lines, each line must contain a string of m characters. The j-th character of the i-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.
1 1.
B
2 2....
BWWB
3 3.-.-----.
B-B-----B
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 <iostream>#include <string.h>#include <algorithm>using namespace std;char a[102][102];int main(){ int n,m; while(~scanf("%d%d",&n,&m)) { getchar(); memset(a,0,sizeof(a)); for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) scanf("%c",&a[i][j]); getchar(); } for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { if(a[i][j]=='.') { if((i+j)%2==0) a[i][j]='W'; else a[i][j]='B'; } printf("%c",a[i][j]); } printf("\n"); } } return 0;}
- codeforce 445 A
- Codeforce A
- Codeforce 445(A,B,C,D,E)
- Codeforce # A Plug-in
- codeforce 2A Winner
- Contest on codeforce A
- codeforce 11 04 A
- codeforce小水题--A. Presents
- Codeforce #145A Cinema
- codeforce日记 371A
- CodeForce 393A Nineteen
- codeforce 402A - Nuts
- Codeforce A. Milking cows
- codeforce 427A
- codeforce 433A
- codeforce 6A
- codeforce 7A
- codeforce 9A
- java 哈希表的几种遍历
- Java NIO系列教程(十二) Java NIO与IO
- 详解操作主机角色,Active Directory系列之九
- 安卓使用HttpClient进行Http Post文件上传
- [LeetCode] Binary Tree Level Order Traversal
- codeforce 445 A
- hdu 2121无根最小树形图要建一个虚拟节点
- Active Directory的复制拓扑,Active Directory系列之八
- 分数表示法
- 移动磁盘显示盘符但无法打开,提示格式化
- linux 分卷压缩命令
- Active Directory的脱机碎片整理,Active Directory系列之七
- c/c++ extern 关键字
- 离线部署额外域控制器,Active Directory系列之六