POJ2993——Emag eht htiw Em Pleh（模拟题）

来源：互联网发布：成语词典软件哪个好编辑：程序博客网时间：2024/05/12 03:02
这题与POJ2996相反，要求是给出各点的位置，输出棋盘分布
模拟题就是水
#include<iostream>#include<cstring>#include<cstdio>using namespace std;int main(){    char map[40][40],w[1000],b[1000];    int i,j,k,r,c,t=0;    for(i=16;i>=0;i--)//棋盘的初始化    {        for(j=0;j<33;j++)        {            if(i&1)            {                if(j%4==0) t++;                if(j%4==0)                {                    map[i][j]='|';                    if(t&1) map[i][j+1]=map[i][j+2]=map[i][j+3]='.';                    else map[i][j+1]=map[i][j+2]=map[i][j+3]=':';                }            }            else{                if(j%4==0) map[i][j]='+';                else map[i][j]='-';            }        }    }        gets(w);gets(b);    for(i=7;w[i]!='\0';i++)    {        if(w[i]==','||w[i]==' ') continue;        else if(w[i]=='K')        {            c=(w[i+1]-'a'+1)*4;            r=w[i+2]+w[i+2]-97;            map[r][c-2]='K';            i+=3;        }        else if(w[i]=='Q')        {            c=(w[i+1]-'a'+1)*4;            r=w[i+2]+w[i+2]-97;            map[r][c-2]='Q';            i+=3;        }        else if(w[i]=='R')        {            c=(w[i+1]-'a'+1)*4;            r=w[i+2]+w[i+2]-97;            map[r][c-2]='R';            i+=3;        }        else if(w[i]=='B')        {            c=(w[i+1]-'a'+1)*4;            r=w[i+2]+w[i+2]-97;            map[r][c-2]='B';            i+=3;        }        else if(w[i]=='N')        {            c=(w[i+1]-'a'+1)*4;            r=w[i+2]+w[i+2]-97;            map[r][c-2]='N';            i+=3;        }        else        {            c=(w[i]-'a'+1)*4;            r=w[i+1]+w[i+1]-97;            map[r][c-2]='P';            i+=2;        }    }    for(i=7;b[i]!='\0';i++)    {        if(b[i]==',') continue;        else if(b[i]=='K')        {            c=(b[i+1]-'a'+1)*4;            r=b[i+2]+b[i+2]-97;            map[r][c-2]='k';            i+=3;        }        else if(b[i]=='Q')        {            c=(b[i+1]-'a'+1)*4;            r=b[i+2]+b[i+2]-97;            map[r][c-2]='q';            i+=3;        }        else if(b[i]=='R')        {            c=(b[i+1]-'a'+1)*4;            r=b[i+2]+b[i+2]-97;            map[r][c-2]='r';            i+=3;        }        else if(b[i]=='B')        {            c=(b[i+1]-'a'+1)*4;            r=b[i+2]+b[i+2]-97;            map[r][c-2]='b';            i+=3;        }        else if(b[i]=='N')        {            c=(b[i+1]-'a'+1)*4;            r=b[i+2]+b[i+2]-97;            map[r][c-2]='n';            i+=3;        }        else        {            c=(b[i]-'a'+1)*4;            r=b[i+1]+b[i+1]-97;            map[r][c-2]='p';            i+=2;        }    }    for(i=16;i>=0;i--)    {        for(j=0;j<33;j++)        {            cout<<map[i][j];            if(j==32) cout<<endl;        }    }    return 0;}
0 0