POJ 2996 Help Me with the Game_不见不散的结局是曲终人散

本文介绍了如何通过读取棋盘布局的ASCII艺术表示，解析并输出国际象棋的标准记谱法。具体步骤包括识别棋盘上的棋子，区分白棋和黑棋，按照标准记谱法格式输出棋子的位置。文中详细解释了如何处理不同类型的棋子（如国王、皇后、车等），以及如何正确地描述棋子在棋盘上的位置，包括字母和数字表示的行和列。同时，文章还讨论了如何处理棋盘上棋子数量的变化，比如棋子被捕获或晋升为皇后的情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Help Me with the Game

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3875		Accepted: 2463

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


 题意：
输出时：

、不论黑白，均是依次输出，强制大写，但不输出“”，只输出其坐标

、对白棋的位置，小行优先大行输出（行的数字越小则优先）同行则按列的顺序

、对黑棋的位置，大行优先小行输出（行的数字越大则优先）同行则按列的顺序

、从、点可以看出，黑棋总是先被输入，白棋总是后输入，即黑棋总在棋盘上方，白棋总在棋盘下方，所以输入完成后，对于黑色棋子只需要按类型次序输出，同类型棋子的顺序就是输入的顺序；而白色棋子要考虑同类型棋子之间的排序，而同类型棋子之间又仅需要考虑不同行棋子之间的排序，同一行棋子的排序就是输入顺序

、棋子可能不齐全，不存在的棋子不输出，用标记解决

、最后的棋子后面不带逗号，要找出最后的棋子
思路：再开一个数组用来存储字母，根据字母的小标位置将起提取出来；然后一次输出就是了；
代码如下：
#include

#include

#include

using namespace std;

char chess[100][100];

char ch[10][10];

struct node

{

    int x;

    int y;

} a1[100],a2[100];

int main()

{

    int i=0,j,t=0;

    for(i=16; i>=0; i--)

        scanf("%s",chess[i]);

    for(i=0; i<17; i++)

    {

        int k=0;

        for(j=0; j<33; j++)

            if(i%2==1&&j%4==2)

                ch[t][k++]=chess[i][j];

        if(i%2==1)

            t++;//求出拥有棋子的行数；

    }

   // 输出白子

    printf("White: ");

    for(i=0; i<8; i++)

        for(j=0; j<8; j++)

            if(ch[i][j]=='K')

                printf("K%c%d,",j+97,i+1);

    for(i=0; i<8; i++)

        for(j=0; j<8; j++)

            if(ch[i][j]=='Q')

                printf("Q%c%d,",j+97,i+1);

    for(i=0; i<8; i++)

        for(j=0; j<8; j++)

            if(ch[i][j]=='R')

                printf("R%c%d,",j+97,i+1);

    for(i=0; i<8; i++)

        for(j=0; j<8; j++)

            if(ch[i][j]=='B')

                printf("B%c%d,",j+97,i+1);

    for(i=0; i<8; i++)