POJ2993《Emag eht htiw Em Pleh》方法：模拟

就是将POJ2996进行反向输出

#include <iostream>#include <cstdio>#include <cstring>using namespace std;class whit {public:int row;char col;char type;} ww[16];class blac {public:int row;char col;char type;} bb[16];int main(){// freopen("temp.txt", "r", stdin);char white[64], black[64];gets(white);gets(black);int w_count = 0, b_count = 0;const int w_length = strlen(white);const int b_length = strlen(black);for (int i = 7, j = 0; i < w_length; ) { // i从"White: "开始，j下标计数if (white[i] >= 'B' && white[i] <= 'R') {ww[j].type = white[i];ww[j].col = white[i+1];ww[j].row = white[i+2] - '0';i += 4;++j;++w_count;} else if (white[i] >= 'a' && white[i] <= 'h') {ww[j].type = 'P';ww[j].col = white[i];ww[j].row = white[i+1] - '0';i += 3;++j;++w_count;}}for (int i = 7, j = 0; i < b_length; ) { // i从"White: "开始，j下标计数if (black[i] >= 'B' && black[i] <= 'R') {bb[j].type = black[i] + 32;bb[j].col = black[i+1];bb[j].row = black[i+2] - '0';i += 4;++j;++b_count;} else if (black[i] >= 'a' && black[i] <= 'h') {bb[j].type = 'p';bb[j].col = black[i];bb[j].row = black[i+1] - '0';i += 3;++j;++b_count;}}// 画棋盘char chess[9]['i'];memset(chess, ':', sizeof(chess));for (int i = 1; i <= 7; i += 2) {for (char j = 'b'; j <= 'h'; j += 2) {chess[i][j] = '.';}}for (int i = 2; i <= 8; i += 2) {for (char j = 'a'; j <= 'g'; j += 2) {chess[i][j] = '.';}}for (int i = 0; i < w_count; ++i)chess[ww[i].row][ww[i].col] = ww[i].type;for (int i = 0; i < b_count; ++i)chess[bb[i].row][bb[i].col] = bb[i].type;// 输出棋盘cout << "+---+---+---+---+---+---+---+---+" << endl;for (int i = 8; i >= 2; i -= 2) { // 两排才能有一样的规律额cout << '|';for (char j = 'a'; j <= 'g'; j += 2)cout << '.' << chess[i][j] << ".|:" << chess[i][j+1] << ":|";cout << endl;cout << "+---+---+---+---+---+---+---+---+" << endl;cout << '|';for (char j = 'a'; j <= 'g'; j += 2)cout << ':' << chess[i-1][j] << ":|." << chess[i-1][j+1] << ".|";cout << endl;cout << "+---+---+---+---+---+---+---+---+" << endl;}return 0;}