CF 445A(DZY Loves Chessboard-BW填充)

A. DZY Loves Chessboard

time limit per test

memory limit per test

input

output

DZY loves chessboard, and he enjoys playing with it.

n rows and m

You task is to find any suitable placement of chessmen on the given chessboard.

Input

n and m (1 ≤ n, m ≤ 100).

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

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.

Sample test(s)

input

1 1 .

output

B

input

2 2 .. ..

output

BW WB

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.

4

3

按照

BWB

WBW

BWB...

这个顺序填充就行

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (100+10)
#define MAXM (100+10)
long long mul(long long a,long long b){return (a*b)%F;}
long long add(long long a,long long b){return (a+b)%F;}
long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}
typedef long long ll;
int n,m;
char a[MAXN][MAXM];
int main()
{
//  freopen("A.in","r",stdin);
//  freopen("A.out","w",stdout);
  scanf("%d%d",&n,&m);
  For(i,n) scanf("%s",a[i]+1);
  
  For(i,n)
  {
    For(j,m)
    {
      if (a[i][j]=='.')
      {
        if ((i+j)&1) printf("W");
        else printf("B");
      }
      else printf("-"); 
    }
    printf("\n");
  }
  
  return 0;
}