Description
Your task is to read a picture of a chessboard position and print it in the chess notation.
Input
The input consists of an ASCII-art picture of a chessboard with chess pieces on positions described by the input. The pieces of the white player are shown in upper-case letters, while the black player’s pieces are lower-case letters. The letters are one of “K” (King), “Q” (Queen), “R” (Rook), “B” (Bishop), “N” (Knight), or “P” (Pawn). The chessboard outline is made of plus (“+”), minus (“-“), and pipe (“|”) characters. The black fields are filled with colons (“:”), white fields with dots (“.”).
Output
The output consists of two lines. The first line consists of the string “White: “, followed by the description of positions of the pieces of the white player. The second line consists of the string “Black: “, followed by the description of positions of the pieces of the black player.
The description of the position of the pieces is a comma-separated list of terms describing the pieces of the appropriate player. The description of a piece consists of a single upper-case letter that denotes the type of the piece (except for pawns, for that this identifier is omitted). This letter is immediatelly followed by the position of the piece in the standard chess notation – a lower-case letter between “a” and “h” that determines the column (“a” is the leftmost column in the input) and a single digit between 1 and 8 that determines the row (8 is the first row in the input).
The pieces in the description must appear in the following order: King(“K”), Queens (“Q”), Rooks (“R”), Bishops (“B”), Knights (“N”), and pawns. Note that the numbers of pieces may differ from the initial position because of capturing the pieces and the promotions of pawns. In case two pieces of the same type appear in the input, the piece with the smaller row number must be described before the other one if the pieces are white, and the one with the larger row number must be described first if the pieces are black. If two pieces of the same type appear in the same row, the one with the smaller column letter must appear first.
Sample Input
+—+—+—+—+—+—+—+—+
|.r.|:::|.b.|:q:|.k.|:::|.n.|:r:|
+—+—+—+—+—+—+—+—+
|:p:|.p.|:p:|.p.|:p:|.p.|:::|.p.|
+—+—+—+—+—+—+—+—+
|…|:::|.n.|:::|…|:::|…|:p:|
+—+—+—+—+—+—+—+—+
|:::|…|:::|…|:::|…|:::|…|
+—+—+—+—+—+—+—+—+
|…|:::|…|:::|.P.|:::|…|:::|
+—+—+—+—+—+—+—+—+
|:P:|…|:::|…|:::|…|:::|…|
+—+—+—+—+—+—+—+—+
|.P.|:::|.P.|:P:|…|:P:|.P.|:P:|
+—+—+—+—+—+—+—+—+
|:R:|.N.|:B:|.Q.|:K:|.B.|:::|.R.|
+—+—+—+—+—+—+—+—+
Sample Output
White: Ke1,Qd1,Ra1,Rh1,Bc1,Bf1,Nb1,a2,c2,d2,f2,g2,h2,a3,e4
Black: Ke8,Qd8,Ra8,Rh8,Bc8,Ng8,Nc6,a7,b7,c7,d7,e7,f7,h7,h6
给出一副ASC码组成的棋盘,按顺序输出棋子的位置。
也不算很累的大模拟,把原始棋盘上的棋子放到另一个可以直接用下标求出的棋盘里,然后再慢慢复制粘贴搞一搞,1A
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cstdio>
#include <set>
//#include <map>
#include <cmath>
#include <algorithm>
#define INF 0x3f3f3f3f
#define MAXN 100
#define Mod 10001
using namespace std;
char tmap[MAXN][MAXN],map[MAXN][MAXN];
struct Node
{
char first;
int last;
};
Node white[MAXN],black[MAXN];
int main()
{
memset(map,0,sizeof(map));
for(int i=17; i>=1; --i)
scanf("%s",tmap[i]+1);
for(int i=2; i<=17; i+=2)
for(int j=3; j<=33; j+=4)
if((tmap[i][j]>='A'&&tmap[i][j]<='Z')||(tmap[i][j]>='a'&&tmap[i][j]<='z'))
map[i/2][(j-3)/4+1]=tmap[i][j];
printf("White: ");
int flag=0;
for(int i=1; i<=8; ++i)
for(int j=1; j<=8; ++j)
if(map[i][j]=='K')
{
if(!flag)
{
flag=1;
printf("K%c%d",j+'a'-1,i);
}
else
printf(",K%c%d",j+'a'-1,i);
}
for(int i=1; i<=8; ++i)
for(int j=1; j<=8; ++j)
if(map[i][j]=='Q')
{
if(!flag)
{
flag=1;
printf("Q%c%d",j+'a'-1,i);
}
else
printf(",Q%c%d",j+'a'-1,i);
}
for(int i=1; i<=8; ++i)
for(int j=1; j<=8; ++j)
if(map[i][j]=='R')
{
if(!flag)
{
flag=1;
printf("R%c%d",j+'a'-1,i);
}
else
printf(",R%c%d",j+'a'-1,i);
}
for(int i=1; i<=8; ++i)
for(int j=1; j<=8; ++j)
if(map[i][j]=='B')
{
if(!flag)
{
flag=1;
printf("B%c%d",j+'a'-1,i);
}
else
printf(",B%c%d",j+'a'-1,i);
}
for(int i=1; i<=8; ++i)
for(int j=1; j<=8; ++j)
if(map[i][j]=='N')
{
if(!flag)
{
flag=1;
printf("N%c%d",j+'a'-1,i);
}
else
printf(",N%c%d",j+'a'-1,i);
}
for(int i=1; i<=8; ++i)
for(int j=1; j<=8; ++j)
if(map[i][j]=='P')
{
if(!flag)
{
flag=1;
printf("%c%d",j+'a'-1,i);
}
else
printf(",%c%d",j+'a'-1,i);
}
printf("\n");
printf("Black: ");
flag=0;
for(int i=8; i>=1; --i)
for(int j=1; j<=8; ++j)
if(map[i][j]=='k')
{
if(!flag)
{
flag=1;
printf("K%c%d",j+'a'-1,i);
}
else
printf(",K%c%d",j+'a'-1,i);
}
for(int i=8; i>=1; --i)
for(int j=1; j<=8; ++j)
if(map[i][j]=='q')
{
if(!flag)
{
flag=1;
printf("Q%c%d",j+'a'-1,i);
}
else
printf(",Q%c%d",j+'a'-1,i);
}
for(int i=8; i>=1; --i)
for(int j=1; j<=8; ++j)
if(map[i][j]=='r')
{
if(!flag)
{
flag=1;
printf("R%c%d",j+'a'-1,i);
}
else
printf(",R%c%d",j+'a'-1,i);
}
for(int i=8; i>=1; --i)
for(int j=1; j<=8; ++j)
if(map[i][j]=='b')
{
if(!flag)
{
flag=1;
printf("B%c%d",j+'a'-1,i);
}
else
printf(",B%c%d",j+'a'-1,i);
}
for(int i=8; i>=1; --i)
for(int j=1; j<=8; ++j)
if(map[i][j]=='n')
{
if(!flag)
{
flag=1;
printf("N%c%d",j+'a'-1,i);
}
else
printf(",N%c%d",j+'a'-1,i);
}
for(int i=8; i>=1; --i)
for(int j=1; j<=8; ++j)
if(map[i][j]=='p')
{
if(!flag)
{
flag=1;
printf("%c%d",j+'a'-1,i);
}
else
printf(",%c%d",j+'a'-1,i);
}
printf("\n");
return 0;
}