【POJ】2993 Emag eht htiw Em Pleh 模拟 逆2996题

#include <stdio.h>
#include <string.h>

typedef struct
{
   char typestyle;
   char column;
   int row;
}type;

int exchg = 0;
char? chess[17][35]=
{
       "+---+---+---+---+---+---+---+---+",
       "|...|:::|...|:::|...|:::|...|:::|",
       "+---+---+---+---+---+---+---+---+",
       "|:::|...|:::|...|:::|...|:::|...|",
       "+---+---+---+---+---+---+---+---+",
       "|...|:::|...|:::|...|:::|...|:::|",
       "+---+---+---+---+---+---+---+---+",
       "|:::|...|:::|...|:::|...|:::|...|",
       "+---+---+---+---+---+---+---+---+",
       "|...|:::|...|:::|...|:::|...|:::|",
       "+---+---+---+---+---+---+---+---+",
       "|:::|...|:::|...|:::|...|:::|...|",
       "+---+---+---+---+---+---+---+---+",
       "|...|:::|...|:::|...|:::|...|:::|",
       "+---+---+---+---+---+---+---+---+",
       "|:::|...|:::|...|:::|...|:::|...|",
       "+---+---+---+---+---+---+---+---+",
},str[2][300];

void? PrintChess()
{
   int? i = 0;
   while(i < 17)
   {
       printf("%sn", chess[i++]);
   }
}

void? Fill(char search[][7], type *t,int j,char? *p)
{
   int index = 5;
   *p = 'X'; //立即逗号换成‘X’，以区别‘p’或‘P’与其它字母
   p -= 3; //指针指到逗号前的第三个字符

   if(*p != 'X') //KQRBN
   {

       index = (char *)memchr(search[exchg], *p, 5) - search[exchg];
       t[index].typestyle = search[j][index];
   }
   else //P
   {
       t[index].typestyle = search[j][5];
   }

   t[index].column = (*(p + 1) - 'a') * 4 + 2; //棋盘行列与chess数组行列之间的转换
   t[index].row = 17 - (*(p + 2) - '0') * 2;
   chess[t[index].row][t[index].column] = t[index].typestyle;
}

int main()
{
   int? j = 0, len, index;
   char search[2][7]={"KQRBNP","kqrbnp"}, s[7], *p, *q, *z, *end;
   type t[6];

   scanf("%s%s%s%s", s, &str[0][1], &str[1][1], &str[1][1]);
   if(strcmp("White:", s)) //若题目先输入Black,则要交换
   {
       strcpy(search[0], "kqrbnp");
       strcpy(search[1], "KQRBNP");
       exchg = 1;
   }
   str[0][0] = str[1][0] = 'X';
   j = 0;
   while(1)
   {
       len = strlen(str[j]);
       end = str[j] + len; //指向Whilte或者Black串的串末,第一次就是WA在这
       if(7 == strlen(str[j]) || 1 == strlen(str[j])) //任何一个为空,即只有White或Black,后面没有棋子说明
       {
           j++;
           if(2 == j)
           {
               break;
           }
           continue;
       }

       index = 5;
       if(p = q = (char *)memchr(str[j], ',', len))
       {
           Fill(search, t, j, p);
           //只需要在剩下的end-q个字符中找,要不然会从str[0]找到str[1]的逗号中导致第二次j循环不会经过上面的if判断
           while(p = (char *)memchr(q, ',', end - q))
           {
               q = p;
               Fill(search, t, j, p);
           }
           z = q + 1; //剩下的一个为非P棋子,指向column字符
       }
       else
       {
           z = &str[j][1];//剩下的一个为P棋子,指向column字符
       }

       if(memchr(search[exchg], *z, strlen(search)))
       {
           index = (char? *)memchr(search[exchg], str[j][1], 5) - search[exchg];
           t[index].typestyle = search[j][index];
           t[index].column = (*(z+1) - 'a') * 4 + 2;
           t[index].row = 17 - (*(z+2) - '0') * 2;
           chess[t[index].row][t[index].column] = t[index].typestyle;
       }
       else
       {
           t[index].typestyle = search[j][5];
           t[index].column = (*z - 'a') * 4 + 2;
           t[index].row = 17 - (*(z+1) - '0') * 2;
           chess[t[index].row][t[index].column] = t[index].typestyle;
       }
       j++;
       if(2 == j)
       {
           break;
       }
   }

   PrintChess();
   return 0;
}

Problem: 2993 User: angrad
Memory: 148K Time: 0MS
Language: C Result: Accepted

tip:

价值千金的批处理:

@echo off
:again
r > input
a < input > output.a
b < input > output.b
fc output.a output.b > nul
if? not errorlevel 1 goto? again

2011-04-09 15:26 发表于百度空间，今搬至CU。