【poj】2996---Help Me with the Game / 2993---Emag eht htiw Em Pleh

2996题目链接
2993题目链接

最近开始刷poj了，这道题非常有意思，题意不难，把国际象棋棋盘上的棋子按照顺序输出，之前觉得这道题很麻烦，不过中途突发奇想用了一些打表把代码写的很简单。

# include <cstdio>
# include <algorithm>

using namespace std;

typedef pair<int , int> P;

const int MAX_N = 8;

int hi[2][8] = {{1 , 2 , 3 , 4 , 5 , 6 , 7 , 8} , {8 , 7 , 6 , 5 , 4 , 3 , 2 , 1}};
char SS[2][6] = {{'K' , 'Q' , 'R' , 'B' , 'N' , 'P'} , {'k' , 'q' , 'r' , 'b' , 'n' , 'p'}};
char w[2][10] = {"White" , "Black"};

P K[2][6][MAX_N];
int N[2][6];
int Z[2];

char maz[17][34];

int main()
{
    int i, j, u, v, k;
    for(i = 0 ; i < 17 ; i++)
        scanf("%s", maz[i]);

    for(u = 0 ; u < 2 ; u++)
    {   
        for(v = 0 ; v < 8 ; v++)
        {
            j = hi[u][v];

            for(i = 1 ; i <= 8 ; i++)
            {
                int x = 17 - 2 * j, y = 4 * i - 2;
                char c = maz[x][y];

                for(k = 0 ; k < 6 ; k++)
                {                   
                    if(c == SS[u][k])
                    {
                        K[u][k][N[u][k]++] = P(i , j);
                        Z[u]++;
                        break;
                    }
                }
            }
        }
    }

    for(i = 0 ; i < 2 ; i++)
    {
        printf("%s: ", w[i]);
        for(j = 0 ; j < 5 ; j++)
        {
            for(k = 0 ; k < N[i][j] ; k++)
                printf("%c%c%d%s", SS[0][j], 'a' - 1 + K[i][j][k].first, K[i][j][k].second, (Z[i]-- == 1) ? "\n" : ",");
        }

        for(k = 0 ; k < N[i][j] ; k++)
            printf("%c%d%s", 'a' - 1 + K[i][j][k].first, K[i][j][k].second, (Z[i]-- == 1) ? "\n" : ",");
    }

    return 0;
} 

这道题算是那道题的变种，正好是相反的，给你这些棋子的坐标，输出棋盘，说实话这个要简单一点

# include <cstdio>
# include <cstring>

char maz[17][34];
char SS[2][6] = {{'K' , 'Q' , 'R' , 'B' , 'N' , 'P'} , {'k' , 'q' , 'r' , 'b' , 'n' , 'p'}};

char s[200];

int main()
{
    int i, j;
    for(i = 0 ; i <= 16 ; i += 2)
        strcpy(maz[i] , "+---+---+---+---+---+---+---+---+");

    for(i = 1 ; i <= 16 ; i += 4)
        strcpy(maz[i] , "|...|:::|...|:::|...|:::|...|:::|");

    for(i = 3 ; i <= 16 ; i += 4)
        strcpy(maz[i] , "|:::|...|:::|...|:::|...|:::|...|");

    for(i = 0 ; i < 2 ; i++)
    {
        scanf("%s", s);
        scanf("%s", s);

        int prv = -1;
        for(j = 0 ; 1 ; j++)
        {
            if(!s[j] || s[j] == ',')
            {
                int x = 17 - 2 * (s[j - 1] - 48);
                int y = 4 * (s[j - 2] - 'a' + 1) - 2;

                if(j - prv == 4)
                {
                    maz[x][y] = s[j - 3];
                    if(i)
                        maz[x][y] += 'a' - 'A';
                }
                else
                    maz[x][y] = SS[i][5];

                prv = j;
            }

            if(!s[j])
                break;
        }
    }

    for(i = 0 ; i < 17 ; i++)
        puts(maz[i]);

    return 0;
}