Programming Challenges 习题 1.6.7

PC/UVa：110107/10196

Check the Check

这道题其实不难，但是有几个点需要注意：

各种边界条件特别容易出错
车、象、后的前进路线上不能有其它棋子挡着
其实不用判断王将军王的情况，因为如果有一个王将军了另一个王，那么必定出现两个王互相将军的情况

#include <iostream>using namespace std;char board[8][8] = { 0 };bool checkp(int i, int j)
{if (i + 1 < 8 && j - 1 >= 0 && board[i + 1][j - 1] == 'K')return true;if (i + 1 < 8 && j + 1 < 8 && board[i + 1][j + 1] == 'K')return true;return false;
}bool checkP(int i, int j)
{if (i - 1 >= 0 && j - 1 >= 0 && board[i - 1][j - 1] == 'k')return true;if (i - 1 >= 0 && j + 1 < 8 && board[i - 1][j + 1] == 'k')return true;return false;
}bool checkrR(int i, int j, char king)
{//upfor (int k = i - 1; k >= 0; k--){if (board[k][j] == king) return true;else if (board[k][j] == '.') continue;else break;}//rightfor (int k = j + 1; k < 8; k++){if (board[i][k] == king) return true;else if (board[i][k] == '.') continue;else break;}//downfor (int k = i + 1; k < 8; k++){if (board[k][j] == king) return true;else if (board[k][j] == '.') continue;else break;}//leftfor (int k = j - 1; k >= 0; k--){if (board[i][k] == king) return true;else if (board[i][k] == '.') continue;else break;}return false;
}bool checkbB(int i, int j, char king)
{//up leftfor (int k = 1; i - k >= 0 && j - k >= 0; k++){if (board[i - k][j - k] == king) return true;else if (board[i - k][j - k] == '.') continue;else break;}//up rightfor (int k = 1; i - k >= 0 && j + k < 8; k++){if (board[i - k][j + k] == king) return true;else if (board[i - k][j + k] == '.') continue;else break;}//down leftfor (int k = 1; i + k < 8 && j - k >= 0; k++){if (board[i + k][j - k] == king) return true;else if (board[i + k][j - k] == '.') continue;else break;}//down rightfor (int k = 1; i + k < 8 && j + k < 8; k++){if (board[i + k][j + k] == king) return true;else if (board[i + k][j + k] == '.') continue;else break;}return false;
}bool checkqQ(int i, int j, char king)
{bool b = checkrR(i, j, king);if (b) return b;else return checkbB(i, j, king);
}bool checkkK(int i, int j, char king)
{if (i - 1 >= 0 && j - 1 >= 0 && board[i - 1][j - 1] == king) return true;else if (i - 1 >= 0 && board[i - 1][j] == king) return true;else if (i - 1 >= 0 && j + 1 < 8 && board[i - 1][j + 1] == king) return true;else if (j + 1 < 8 && board[i][j + 1] == king) return true;else if (i + 1 < 8 && j + 1 < 8 && board[i + 1][j + 1] == king) return true;else if (i + 1 < 8 && board[i + 1][j] == king) return true;else if (i + 1 < 8 && j - 1 >= 0 && board[i + 1][j - 1] == king) return true;else if (j - 1 >= 0 && board[i][j - 1] == king) return true;else return false;
}bool checknN(int i, int j, char king)
{if (i - 1 >= 0 && j - 2 >= 0 && board[i - 1][j - 2] == king) return true;else if (i - 2 >= 0 && j - 1 >= 0 && board[i - 2][j - 1] == king) return true;else if (i - 2 >= 0 && j + 1 < 8 && board[i - 2][j + 1] == king) return true;else if (i - 1 >= 0 && j + 2 < 8 && board[i - 1][j + 2] == king) return true;else if (i + 1 < 8 && j + 2 < 8 && board[i + 1][j + 2] == king) return true;else if (i + 2 < 8 && j + 1 < 8 && board[i + 2][j + 1] == king) return true;else if (i + 2 < 8 && j - 1 >= 0 && board[i + 2][j - 1] == king) return true;else if (i + 1 < 8 && j - 2 >= 0 && board[i + 1][j - 2] == king) return true;else return false;
}bool check(int cnt)
{bool bLast = true, bBlack = false, bWhite = false;for (int i = 0; i < 8; i++){for (int j = 0; j < 8; j++){cin >> board[i][j];if (board[i][j] != '.') bLast = false;}}if (bLast) return bLast;cout << "Game #" << cnt << ": ";for (int i = 0; i < 8; i++){for (int j = 0; j < 8; j++){switch (board[i][j]){case 'p':bWhite = checkp(i, j);break;case 'P':bBlack = checkP(i, j);break;case 'r':bWhite = checkrR(i, j, 'K');break;case 'R':bBlack = checkrR(i, j, 'k');break;case 'b':bWhite = checkbB(i, j, 'K');break;case 'B':bBlack = checkbB(i, j, 'k');break;case 'q':bWhite = checkqQ(i, j, 'K');break;case 'Q':bBlack = checkqQ(i, j, 'k');break;case 'k':bWhite = checkkK(i, j, 'K');break;case 'K':bBlack = checkkK(i, j, 'k');break;case 'n':bWhite = checknN(i, j, 'K');break;case 'N':bBlack = checknN(i, j, 'k');break;default:break;}if (bWhite || bBlack){if (bWhite) cout << "white king is in check." << endl;else if (bBlack) cout << "black king is in check." << endl;return false;}}}cout << "no king is in check." << endl;return false;
}int main()
{bool bLast = false;int cnt = 1;while (!bLast){bLast = check(cnt++);}return 0;
}
/*
..k.....
ppp.pppp
........
.R...B..
........
........
PPPPPPPP
K.......rnbqkbnr
pppppppp
........
........
........
........
PPPPPPPP
RNBQKBNRrnbqk.nr
ppp..ppp
....p...
...p....
.bPP....
.....N..
PP..PPPP
RNBQKB.R........
........
........
........
........
........
........
........
*/

Programming Challenges 习题 1.6.7相关推荐

Dynamic Languages — ready for the next challenges, by design
Dynamic Languages - ready for the next challenges, by design. David Ascher, PhD, ActiveState1 July 2 ...
杭电acm第2304题答案c语言,【转】杭电ACM试题分类
注:网上搜的第一篇 1001 这个就不用说了吧 1002 简单的大数 1003 DP经典问题,最大连续子段和 1004 简单题 1005 找规律(循环点) 1006 感觉有点BT的题,我到现在还没过 ...
华为技术面试编码题_最佳技术编码面试准备书
华为技术面试编码题 Technical coding interviews are notoriously difficult - almost borderline quiz-like for th ...
倦怠和枯燥_如何不断学习（不倦怠）
倦怠和枯燥 In tech, constantly learning (both in and out of work) is an unstated job requirement. 在科技界,不断 ...
java面试编程面试题_完美的编程面试问题
java面试编程面试题 by Sachin Malhotra 由Sachin Malhotra 完美的编程面试问题 (The Perfect Programming Interview Problem ...
对开发者有用的英文网站合集，建议收藏！
问答社区 Stack Overflow : subscribe to their weekly newsletter and any other topic which you find inte ...
Online Judge for ACM-ICPC etc.
Virtual JudgeACM-ICPC Live Archive - HomeUVa Online Judge - HomeWelcome To PKU JudgeOnline(POJ)Welco ...
开发者必备英文网站合集
这是一份对开发者有用的英文网站清单,涉及到从初学者到行业大牛成长的方方面面,还有很多事英语学习的网站,请相信我,这些肯定会对你有所帮助的. CareerBuilder.GitHub.Google.Ha ...
教孩子学编程python豆瓣_教孩子学编程 Python
教孩子学习Python目录第1章Python编程基础知识:了解环境111知道Python 312编写的Python程序513运行Python程序514章总结615编程挑战7章2只乌龟图:图纸与Pyth ...

Programming Challenges 习题 1.6.7

Programming Challenges 习题 1.6.7相关推荐

最新文章

热门文章