POJ 2993 Emag eht htiw Em Pleh(模拟）

题目链接

只要理解了题意之后，就不是很难了。学长们，把题意讲的很明白了。：和.交替出现，坐标系是按平常数学上的坐标系建法。居然1Y了，意外。

#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
char p[101][101];
void judge(char *s1,char *s2)
{
    int i,len1,len2;
    len1 = strlen(s1);
    len2 = strlen(s2);
    for(i = 0; i <= len1-1; i ++)
    {
        if(s1[i] == ' '||s1[i] == ',')
        {
            if(s1[i+1] >= 'a'&&s1[i+1] <= 'h')
            {
                p[s1[i+1]-'a'+1][s1[i+2]-'0'] = 'P';
            }
            else
            {
                p[s1[i+2]-'a'+1][s1[i+3]-'0'] = s1[i+1];
            }
        }
    }
    for(i = 0; i <= len2-1; i ++)
    {
        if(s2[i] == ' '||s2[i] == ',')
        {
            if(s2[i+1] >= 'a'&&s2[i+1] <= 'h')
            {
                p[s2[i+1]-'a'+1][s2[i+2]-'0'] = 'p';
            }
            else
            {
                p[s2[i+2]-'a'+1][s2[i+3]-'0'] = s2[i+1]+'a'-'A';
            }
        }
    }
}
int main()
{
    int i,j;
    char s1[101],s2[101];
    gets(s1);
    gets(s2);
    if(s1[0] == 'W')
    {
        judge(s1,s2);
    }
    else
    {
        judge(s2,s1);
    }
    printf("+---+---+---+---+---+---+---+---+\n");
    for(j = 8;j >= 1;j --)
    {
        printf("|");
        for(i = 1;i <= 8;i ++)
        {
            if((i+j)%2)
            {
                if(!p[i][j])
                {
                    printf("...");
                }
                else
                {
                    printf(".%c.",p[i][j]);
                }
            }
            else
            {
                 if(!p[i][j])
                {
                    printf(":::");
                }
                else
                {
                    printf(":%c:",p[i][j]);
                }
            }
            printf("|");
        }
        printf("\n+---+---+---+---+---+---+---+---+\n");
    }
    return 0;
}