人生第一道CFLoves Chessboard
2014-07-08 08:38
274 查看
#include <stdio.h> #include <string.h> #include <stdlib.h> #include <limits.h> #include <ctype.h> #include <math.h> #include <malloc.h> #include <string.h> #include <algorithm> #include <iostream> #include <string> #include <stack> #include <queue> #include <deque> #include <vector> #include <set> #include <map> using namespace std; #define N 105 char a ; int main(){ int n,m; int i,j; while(~scanf("%d%d",&n,&m)){ for(i=0;i<n;i++){ getchar(); for(j=0;j<m;j++){ scanf("%c",&a[i][j]); } } for(i=0;i<n;i++){ for(j=0;j<m;j++){ if(a[i][j] == '.'){ if((i+j)%2 == 0){//根据每个点的坐标和来判断。 a[i][j] = 'B'; } else a[i][j] = 'W'; } } } for(i=0;i<n;i++){ for(j=0;j<m;j++){ if(j != m-1) printf("%c",a[i][j]); else printf("%c\n",a[i][j]); } } } return 0; } //刚开始的时候想用BFS来做。后来写好之后总有错误。改了好久。。。。。。。毕竟还是渣渣。。。。 //看到题目首先要想到简单的方法。如果想不到,再想算法
原题http://codeforces.com/contest/445/problem/A
相关文章推荐
- A. DZY Loves Chessboard (CF)
- CF 445A(DZY Loves Chessboard-BW填充)
- 【CF】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
- dzy loves chessboard
- Codeforces445A_DZY Loves Chessboard(预处理)
- DZY Loves Chessboard
- CF 266B Queue at the School (人生第一道B题)
- Codeforces Round #254 (Div. 2):A. DZY Loves Chessboard
- Codeforces Round #254 (Div. 2) A. DZY Loves Chessboard —— dfs
- Codeforces 445 A DZY Loves Chessboard(预处理)
- DZY Loves Chessboard
- A. DZY Loves Chessboard
- 【CodeForces】445A - DZY Loves Chessboard(dfs)
- [CodeForces445A]DZY Loves Chessboard[bfs]
- Codeforces Round #254 (Div. 2) A. DZY Loves Chessboard
- CodeForces - 445A - DZY Loves Chessboard
- codeforces 445 A. DZY Loves Chessboard