POJ2996 & POJ2993 (模拟)

来源：互联网发布：淘宝描述不符有赔偿吗编辑：程序博客网时间：2024/05/22 09:47

附problem 2996 题目链接http://poj.org/problem?id=2996

思路：所给的每个棋子的数目是固定的，所以根据棋盘棋子的摆放和输出结果找规律模拟出来就好。要注意的是：所有的棋子都是按照KQRBNP的顺序输出的，但白棋和黑棋的遍历顺序不同，白棋按照行从大到小，列从小到大的顺序，黑棋按照行列都从小到大的顺序遍历。

AC代码入下：

#include <cstdio>#include <cstring>using namespace std;char str[45][45];int main(){for(int i = 0; i < 17; i ++)scanf("%s",&str[i]);printf("White: ");for(int i = 15; i >= 1; i -= 2){for(int j = 2; j < 31; j += 4){if(str[i][j] == 'K')printf("K%c%d",'a' + j/4,8-i/2);}}for(int i = 15; i >= 1; i -= 2){for(int j = 2; j < 31; j += 4){if(str[i][j] == 'Q')printf(",Q%c%d",'a' + j/4,8-i/2);}}for(int i = 15; i >= 1; i -= 2){for(int j = 2; j < 31; j += 4){if(str[i][j] == 'R')printf(",R%c%d",'a' + j/4,8-i/2);}}for(int i = 15; i >= 1; i -= 2){for(int j = 2; j < 31; j += 4){if(str[i][j] == 'B')printf(",B%c%d",'a' + j/4,8-i/2);}}for(int i = 15; i >= 1; i -= 2){for(int j = 2; j < 31; j += 4){if(str[i][j] == 'N')printf(",N%c%d",'a' + j/4,8-i/2);}}for(int i = 15; i >= 1; i -= 2){for(int j = 2; j < 31; j += 4){if(str[i][j] == 'P')printf(",%c%d",'a' + j/4,8-i/2);}}printf("\n");printf("Black: ");for(int i = 1; i <= 15; i +=2){for(int j = 2; j < 31; j += 4){if(str[i][j] == 'k')printf("K%c%d",'a' + j/4,8 - i/2);}}for(int i = 1; i <= 15; i +=2){for(int j = 2; j < 31; j += 4){if(str[i][j] == 'q')printf(",Q%c%d",'a' + j/4,8 - i/2);}}for(int i = 1; i <= 15; i +=2){for(int j = 2; j < 31; j += 4){if(str[i][j] == 'r')printf(",R%c%d",'a' + j/4,8 - i/2);}}for(int i = 1; i <= 15; i +=2){for(int j = 2; j < 31; j += 4){if(str[i][j] == 'b')printf(",B%c%d",'a' + j/4,8 - i/2);}}for(int i = 1; i <= 15; i +=2){for(int j = 2; j < 31; j += 4){if(str[i][j] == 'n')printf(",N%c%d",'a' + j/4,8 - i/2);}}for(int i = 1; i <= 15; i +=2){for(int j = 2; j < 31; j += 4){if(str[i][j] == 'p')printf(",%c%d",'a' + j/4,8 - i/2);}}printf("\n");return 0;}

附problem 2993题目链接http://poj.org/problem?id=2993

把棋盘转换下输出即可。。。和2996有联系，把转换的式子转换一下即可。

AC代码入下：

#include <cstdio>#include <cstring>using namespace std;char white[40],black[40],maze[45][45],str[40];void Init(){for(int i = 0; i < 40; i ++){if(i % 2 == 1 && i % 4 != 3){strcpy(maze[i],"|...|:::|...|:::|...|:::|...|:::|");}else if(i % 4 == 3){strcpy(maze[i],"|:::|...|:::|...|:::|...|:::|...|");}else{strcpy(maze[i],"+---+---+---+---+---+---+---+---+");}}//for(int i = 0; i < 17; i ++)//printf("%s\n",maze[i]);}void solve(){for(int i = 0; i < strlen(white);){if(white[i] == ','){i ++; continue;}if(white[i] >= 'A' && white[i] <= 'Z'){int x=8-(white[i+2]-'0');            int y=white[i+1]-'a';             maze[2*x+1][4*y+2]=white[i];            i += 3;}else{int x=8-(white[i+1]-'0');            int y=white[i]-'a';            maze[2*x+1][4*y+2]='P';            i += 2;}}for(int i = 0; i < strlen(black);){if(black[i] == ','){i ++; continue;}if(black[i] >= 'A' && black[i] <= 'Z'){int x=8-(black[i+2]-'0');            int y=black[i+1]-'a';             maze[2*x+1][4*y+2]=black[i] + 32;            i += 3;}else{int x=8-(black[i+1]-'0');            int y=black[i]-'a';            maze[2*x+1][4*y+2]='p';            i += 2;}}}int main(){Init();scanf("%s%s",&str,&white);scanf("%s%s",&str,&black);solve();for(int i = 0; i < 17; i ++)printf("%s\n",maze[i]);return 0;}

阅读全文

0 0