poj2993Emag eht htiw Em Pleh

最新推荐文章于 2021-10-25 16:20:40 发布

Angel_XiaoXiong

最新推荐文章于 2021-10-25 16:20:40 发布

阅读量424

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM 基本算法---模拟法

本文链接：https://blog.youkuaiyun.com/ViolentLittleAngel/article/details/51588874

ACM 基本算法---模拟法专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一个使用C语言实现的模拟国际象棋棋盘布局的方法。通过解析输入字符串来确定棋子的位置，并将其显示在一个预定义的棋盘上。程序能够处理不同类型的棋子及其位置信息。

http://poj.org/problem?id=2993

模拟

#include<stdio.h>
#include<string.h>
#define Max 100
char map[17][34] = { "+---+---+---+---+---+---+---+---+",//初始化棋盘
                        "|...|:::|...|:::|...|:::|...|:::|",
                        "+---+---+---+---+---+---+---+---+",
                        "|:::|...|:::|...|:::|...|:::|...|",
                        "+---+---+---+---+---+---+---+---+",
                        "|...|:::|...|:::|...|:::|...|:::|",       
                        "+---+---+---+---+---+---+---+---+",
                        "|:::|...|:::|...|:::|...|:::|...|",
                        "+---+---+---+---+---+---+---+---+",
                        "|...|:::|...|:::|...|:::|...|:::|",
                        "+---+---+---+---+---+---+---+---+",
                        "|:::|...|:::|...|:::|...|:::|...|",
                        "+---+---+---+---+---+---+---+---+",
                        "|...|:::|...|:::|...|:::|...|:::|",
                        "+---+---+---+---+---+---+---+---+",
                        "|:::|...|:::|...|:::|...|:::|...|",
                        "+---+---+---+---+---+---+---+---+" };
int find_r(char n)//找出棋子在棋盘上所对应的横坐标
{   
    int r = n -'0';
    r = r*2-1;
    return 16-r;
}
int find_c(char n)//找出棋子在棋盘上所对应的纵坐标
{    
    int c = n - 96;
    return 4 * c - 2;
}
int main()
{
    int i, j;
    char str[Max], r, c;
    gets(str);//White[]
    for(i = 7; str[i] >= 'A' && str[i] <= 'Z'; i += 4)//处理白棋K, Q, R, B和N。
    {   
        r = find_r(str[i + 2]);
        c = find_c(str[i + 1]);
        map[r][c] = str[i];
    }
    for(j = i; str[j] >= 'a' && str[j] <= 'z'; j += 3)//处理白棋的p。
    {   
        r = find_r(str[j + 1]);
        c = find_c(str[j]);
        map[r][c] = 'P';
    }
    gets(str);//Black[]
    for(i = 7; str[i] >= 'A' && str[i] <= 'Z'; i += 4)//处理黑棋K, Q, R, B和N。
    {
        r = find_r(str[i + 2]);
        c = find_c(str[i + 1]);
        map[r][c] = str[i] + 32;
    }
    for(j = i; str[j] >= 'a' && str[j] <= 'z'; j += 3)//处理黑棋的p。
    {   
        r = find_r(str[j + 1]);
        c = find_c(str[j]);
        map[r][c] = 'p';
    }
    for(i = 0; i < 17; i ++)
    {
        for(j = 0; j < 33; j ++)
            printf("%c",map[i][j]);
        printf("\n");
    }
    return 0;
} </span>