Problem G: Check The Check

Time Limit: 1 Sec  Memory Limit: 64 MB
Submit: 10  Solved: 3
[Submit][Status][Web Board]

Description

Your task is to write a program that reads a chessboard configuration and identifies whether a king is under attack (in check). A king is in check if it is on square which can be taken by the opponent on his next move. White pieces will be represented by uppercase letters, and black pieces by lowercase letters. The white side will always be on the bottom of the board, with the black side always on the top. For those unfamiliar with chess, here are the movements of each piece: Pawn (p or P): can only move straight ahead, one square at a time. However, it takes pieces diagonally, and that is what concerns you in this problem. Knight (n or N) : has an L-shaped movement shown below. It is the only piece that can jump over other pieces. Bishop (b or B) : can move any number of squares diagonally, either forward or backward. Rook (r or R) : can move any number of squares vertically or horizontally, either forward or backward. Queen (q or Q) : can move any number of squares in any direction (diagonally, horizontally, or vertically) either forward or backward. King (k or K) : can move one square at a time in any direction (diagonally, horizontally, or vertically) either forward or backward. Movement examples are shown below, where ``*'' indicates the positions where the piece can capture another piece:

 Pawn          Rook          Bishop        Queen         King          Knight

 ........      ...*....      .......*      ...*...*      ........      ........

 ........      ...*....      *.....*.      *..*..*.      ........      ........

 ........      ...*....      .*...*..      .*.*.*..      ........      ..*.*...

 ........      ...*....      ..*.*...      ..***...      ..***...      .*...*..

 ...p....      ***r****      ...b....      ***q****      ..*k*...      ...n....

 ..*.*...      ...*....      ..*.*...      ..***...      ..***...      .*...*..

 ........      ...*....      .*...*..      .*.*.*..      ........      ..*.*...

 ........      ...*....      *.....*.      *..*..*.      ........      ........

Remember that the knight is the only piece that can jump over other pieces. The pawn movement will depend on its side. If it is a black pawn, it can only move one square diagonally down the board. If it is a white pawn, it can only move one square diagonally up the board. The example above is a black pawn, described by a lowercase ``p''. We use ``move" to indicate the squares where the pawn can capture another piece.

Input

There will be an arbitrary number of board configurations in the input, each consisting of eight lines of eight characters each. A ``.'' denotes an empty square, while upper- and lowercase letters represent the pieces as defined above. There will be no invalid characters and no configurations where both kings are in check. You must read until you find an empty board consisting only of ``.'' characters, which should not be processed. There will be an empty line between each pair of board configurations. All boards, except for the empty one, will contain exactly one white king and one black king.

Output

For each board configuration read you must output one of the following answers: Game #d: white king is in check. Game #d: black king is in check. Game #d: no king is in check. where d stands for the game number starting from 1.

Sample Input

..k.....

ppp.pppp

........

.R...B..

........

........

PPPPPPPP

K.......

rnbqk.nr

ppp..ppp

....p...

...p....

.bPP....

.....N..

PP..PPPP

RNBQKB.R

........

........

........

........

........

........

........

........

Sample Output

Game #: black king is in check.

Game #: white king is in check.

HINT

　　模拟题。模拟的是国际象棋。通过输入棋子的分布（8*8的棋盘上），判断下一步哪一方会被将军或者是平局。没什么技术含量，写一个switch语句，将所有种类棋子的情况写进去，然后依次检测每一个棋子。检测完白字就检测黑子。如果被将军就跳出输出结果。

　　写了300多行，真是麻烦。

My code:

 #include <iostream>

 using namespace std;

 int main()

 {

     char q[][];

     int count = ;

     while(true){

         //input

         int i,j;

         bool f=true;

         for(i=;i<=;i++)

             for(j=;j<=;j++){

                 cin>>q[i][j];

                 if(q[i][j]!='.')

                     f=false;

             }

         if(f) break;    //如果是空棋盘，退出

         //不是空棋盘，检测每一个棋子是否有将军的能力。

         bool fw=false,fb=false; //判断白子和黑子谁能赢

         int n;

         int ii,jj;

         //先检测白子

         for(i=;i<=;i++){

             for(j=;j<=;j++){

                 if(q[i][j]=='.' || ('a'<=q[i][j] && q[i][j]<='z') ) continue;   //如果无子或者检测到黑子（小写），则跳过

                 switch(q[i][j]){

                 case 'P':   //卒

                     if(q[i-][j-]=='k' || q[i-][j+]=='k')

                         fw=true;

                     break;

                 case 'R':   //车

                     //左

                     n=j-;

                     while(--n){

                         if(q[i][n]=='k') {fw=true;break;}

                         else if(q[i][n]!='.') break;

                     }

                     //右

                     n=j+;

                     while(fw!=true && (++n)<= ){

                         if(q[i][n]=='k') {fw=true;break;}

                         else if(q[i][n]!='.') break;

                     }

                     //上

                     n=i-;

                     while(fw!=true && --n){

                         if(q[n][j]=='k') {fw=true;break;}

                         else if(q[n][j]!='.') break;

                     }

                     //下

                     n=i+;

                     while(fw!=true && (++n)<= ){

                         if(q[n][j]=='k') {fw=true;break;}

                         else if(q[n][j]!='.') break;

                     }

                     break;

                 case 'B':   //象

                     //左上

                     ii=i-;

                     jj=j-;

                     while(ii>= && jj>=){

                         if(q[ii][jj]=='k') {fw=true;break;}

                         else if(q[ii][jj]!='.') break;

                         --ii,--jj;

                     }

                     //右上

                     ii=i-;

                     jj=j+;

                     while(!fw && ii>= && jj<=){

                         if(q[ii][jj]=='k') {fw=true;break;}

                         else if(q[ii][jj]!='.') break;

                         --ii,++jj;

                     }

                     //左下

                     ii=i+;

                     jj=j-;

                     while(!fw && ii<= && jj>=){

                         if(q[ii][jj]=='k') {fw=true;break;}

                         else if(q[ii][jj]!='.') break;

                         ++ii,--jj;

                     }

                     //右下

                     ii=i+;

                     jj=j+;

                     while(!fw && ii<= && jj<=){

                         if(q[ii][jj]=='k') {fw=true;break;}

                         else if(q[ii][jj]!='.') break;

                         ++ii,++jj;

                     }

                     break;

                 case 'Q':   //后

                     //左

                     n=j-;

                     while(--n){

                         if(q[i][n]=='k') {fw=true;break;}

                         else if(q[i][n]!='.') break;

                     }

                     //右

                     n=j+;

                     while(fw!=true && (++n)<= ){

                         if(q[i][n]=='k') {fw=true;break;}

                         else if(q[i][n]!='.') break;

                     }

                     //上

                     n=i-;

                     while(fw!=true && --n){

                         if(q[n][j]=='k') {fw=true;break;}

                         else if(q[n][j]!='.') break;

                     }

                     //下

                     n=i+;

                     while(fw!=true && (++n)<= ){

                         if(q[n][j]=='k') {fw=true;break;}

                         else if(q[n][j]!='.') break;

                     }

                     //左上

                     ii=i-;

                     jj=j-;

                     while(ii>= && jj>=){

                         if(q[ii][jj]=='k') {fw=true;break;}

                         else if(q[ii][jj]!='.') break;

                         --ii,--jj;

                     }

                     //右上

                     ii=i-;

                     jj=j+;

                     while(!fw && ii>= && jj<=){

                         if(q[ii][jj]=='k') {fw=true;break;}

                         else if(q[ii][jj]!='.') break;

                         --ii,++jj;

                     }

                     //左下

                     ii=i+;

                     jj=j-;

                     while(!fw && ii<= && jj>=){

                         if(q[ii][jj]=='k') {fw=true;break;}

                         else if(q[ii][jj]!='.') break;

                         ++ii,--jj;

                     }

                     //右下

                     ii=i+;

                     jj=j+;

                     while(!fw && ii<= && jj<=){

                         if(q[ii][jj]=='k') {fw=true;break;}

                         else if(q[ii][jj]!='.') break;

                         ++ii,++jj;

                     }

                     break;

                 case 'K':   //王

                     //上下左右

                     if(q[i-][j]=='k'){fw=true;break;}

                     else if(q[i+][j]=='k'){fw=true;break;}

                     else if(q[i][j-]=='k'){fw=true;break;}

                     else if(q[i][j+]=='k'){fw=true;break;}

                     //左上右上左下右下

                     else if(q[i-][j-]=='k'){fw=true;break;}

                     else if(q[i-][j+]=='k'){fw=true;break;}

                     else if(q[i+][j-]=='k'){fw=true;break;}

                     else if(q[i+][j+]=='k'){fw=true;break;}

                     break;

                 case 'N':   //马

                     //转一圈检测，从正上偏左第一个开始

                     if(q[i-][j-]=='k'){fw=true;break;}

                     else if(q[i-][j+]=='k'){fw=true;break;}

                     else if(q[i-][j+]=='k'){fw=true;break;}

                     else if(q[i+][j+]=='k'){fw=true;break;}

                     else if(q[i+][j+]=='k'){fw=true;break;}

                     else if(q[i+][j-]=='k'){fw=true;break;}

                     else if(q[i+][j-]=='k'){fw=true;break;}

                     else if(q[i-][j-]=='k'){fw=true;break;}

                     break;

                 case '.':   //无子

                     break;

                 }

                 if(fw) break;

             }

             if(fw) break;

         }

         //检测黑子

         for(i=;i<=;i++){

             for(j=;j<=;j++){

                 if(q[i][j]=='.' || ('A'<=q[i][j] && q[i][j]<='Z') ) continue;   //如果无子或者检测到白子（大写），则跳过

                 switch(q[i][j]){

                 case 'p':   //卒

                     if(q[i-][j-]=='K' || q[i-][j+]=='K')

                         fb=true;

                     break;

                 case 'r':   //车

                     //左

                     n=j-;

                     while(--n){

                         if(q[i][n]=='K') {fb=true;break;}

                         else if(q[i][n]!='.') break;

                     }

                     //右

                     n=j+;

                     while(fb!=true && (++n)<= ){

                         if(q[i][n]=='K') {fb=true;break;}

                         else if(q[i][n]!='.') break;

                     }

                     //上

                     n=i-;

                     while(fb!=true && --n){

                         if(q[n][j]=='K') {fb=true;break;}

                         else if(q[n][j]!='.') break;

                     }

                     //下

                     n=i+;

                     while(fb!=true && (++n)<= ){

                         if(q[n][j]=='K') {fb=true;break;}

                         else if(q[n][j]!='.') break;

                     }

                     break;

                 case 'b':   //象

                     //左上

                     ii=i-;

                     jj=j-;

                     while(ii>= && jj>=){

                         if(q[ii][jj]=='K') {fb=true;break;}

                         else if(q[ii][jj]!='.') break;

                         --ii,--jj;

                     }

                     //右上

                     ii=i-;

                     jj=j+;

                     while(!fb && ii>= && jj<=){

                         if(q[ii][jj]=='K') {fb=true;break;}

                         else if(q[ii][jj]!='.') break;

                         --ii,++jj;

                     }

                     //左下

                     ii=i+;

                     jj=j-;

                     while(!fb && ii<= && jj>=){

                         if(q[ii][jj]=='K') {fb=true;break;}

                         else if(q[ii][jj]!='.') break;

                         ++ii,--jj;

                     }

                     //右下

                     ii=i+;

                     jj=j+;

                     while(!fb && ii<= && jj<=){

                         if(q[ii][jj]=='K') {fb=true;break;}

                         else if(q[ii][jj]!='.') break;

                         ++ii,++jj;

                     }

                     break;

                 case 'Q':   //后

                     //左

                     n=j-;

                     while(--n){

                         if(q[i][n]=='K') {fb=true;break;}

                         else if(q[i][n]!='.') break;

                     }

                     //右

                     n=j+;

                     while(fb!=true && (++n)<= ){

                         if(q[i][n]=='K') {fb=true;break;}

                         else if(q[i][n]!='.') break;

                     }

                     //上

                     n=i-;

                     while(fb!=true && --n){

                         if(q[n][j]=='K') {fb=true;break;}

                         else if(q[n][j]!='.') break;

                     }

                     //下

                     n=i+;

                     while(fb!=true && (++n)<= ){

                         if(q[n][j]=='K') {fb=true;break;}

                         else if(q[n][j]!='.') break;

                     }

                     //左上

                     ii=i-;

                     jj=j-;

                     while(ii>= && jj>=){

                         if(q[ii][jj]=='K') {fb=true;break;}

                         else if(q[ii][jj]!='.') break;

                         --ii,--jj;

                     }

                     //右上

                     ii=i-;

                     jj=j+;

                     while(!fb && ii>= && jj<=){

                         if(q[ii][jj]=='K') {fb=true;break;}

                         else if(q[ii][jj]!='.') break;

                         --ii,++jj;

                     }

                     //左下

                     ii=i+;

                     jj=j-;

                     while(!fb && ii<= && jj>=){

                         if(q[ii][jj]=='K') {fb=true;break;}

                         else if(q[ii][jj]!='.') break;

                         ++ii,--jj;

                     }

                     //右下

                     ii=i+;

                     jj=j+;

                     while(!fb && ii<= && jj<=){

                         if(q[ii][jj]=='K') {fb=true;break;}

                         else if(q[ii][jj]!='.') break;

                         ++ii,++jj;

                     }

                     break;

                 case 'K':   //王

                     //上下左右

                     if(q[i-][j]=='K'){fb=true;break;}

                     else if(q[i+][j]=='K'){fb=true;break;}

                     else if(q[i][j-]=='K'){fb=true;break;}

                     else if(q[i][j+]=='K'){fb=true;break;}

                     //左上右上左下右下

                     else if(q[i-][j-]=='K'){fb=true;break;}

                     else if(q[i-][j+]=='K'){fb=true;break;}

                     else if(q[i+][j-]=='K'){fb=true;break;}

                     else if(q[i+][j+]=='K'){fb=true;break;}

                     break;

                 case 'N':   //马

                     //转一圈检测，从正上偏左第一个开始

                     if(q[i-][j-]=='k'){fb=true;break;}

                     else if(q[i-][j+]=='K'){fb=true;break;}

                     else if(q[i-][j+]=='K'){fb=true;break;}

                     else if(q[i+][j+]=='K'){fb=true;break;}

                     else if(q[i+][j+]=='K'){fb=true;break;}

                     else if(q[i+][j-]=='K'){fb=true;break;}

                     else if(q[i+][j-]=='K'){fb=true;break;}

                     else if(q[i-][j-]=='K'){fb=true;break;}

                     break;

                 default:break;

                 }

                 if(fb) break;

             }

             if(fb) break;

         }

         if(fw==true && fb==false)

             cout<<"Game #"<<count++<<": "<<"black king is in check."<<endl;

         else if(fb==true && fw==false)

             cout<<"Game #"<<count++<<": "<<"white king is in check."<<endl;

         else if(fw==false && fb==false)

             cout<<"Game #"<<count++<<": "<<"no king is in check."<<endl;

         else break;

     }

     return ;

 }

Freecode : www.cnblogs.com/yym2013

烟大 Contest1024 - 《挑战编程》第一章：入门 Problem G: Check The Check（模拟国际象棋）的更多相关文章

  1. ACM YTU 《挑战编程》第一章 入门 Problem E: Graphical Editor

    Description Graphical editors such as Photoshop allow us to alter bit-mapped images in the same way ...

  2. Windows核心编程第一章.错误处理

    Windows核心编程第一章,错误处理. 一丶错误处理 1.核心编程学习总结 不管是做逆向,开始做开发.在Windows下.你都需要看一下核心编程这本书.这本书确实写得很好.所以自己在学习这本书的同时 ...

  3. .NET Core实战项目之CMS 第一章 入门篇-开篇及总体规划

    作者:依乐祝 原文地址:https://www.cnblogs.com/yilezhu/p/9977862.html 写在前面 千呼万唤始出来,首先,请允许我长吸一口气!真没想到一份来自28岁老程序员 ...

  4. net core体系-web应用程序-4asp.net core2.0 项目实战（CMS）-第一章 入门篇-开篇及总体规划

    .NET Core实战项目之CMS 第一章 入门篇-开篇及总体规划   原文地址:https://www.cnblogs.com/yilezhu/p/9977862.html 写在前面 千呼万唤始出来 ...

  5. Java 面向对象编程——第一章 初识Java

      第一章    初识Java 1.  什么是Java? Java是一种简单的.面向对象的.分布式的.解释的.安全的.可移植的.性能优异的多线程语言.它以其强安全性.平台无关性.硬件结构无关性.语言简 ...

  6. Java学习笔记 第一章 入门<转>

    第一章 JAVA入门 一.基础常识 1.软件开发 什么是软件? 软件:一系列按照特定顺序组织的计算机数据和指令的集合 系统软件:DOS,Windows,Linux 应用软件:扫雷.QQ.迅雷 什么是开 ...

  7. windows核心编程-第一章 对程序错误的处理

    第一章-对程序错误的处理 在开始介绍Microsoft Windows 的特性之前,必须首先了解 Wi n d o w s的各个函数是如何进行错误处理的. 当调用一个Wi n d o w s函数时,它 ...

  8. UNIX环境高级编程--第一章 UNIX基础知识

    第一章 UNIX基础知识 1.2 UNIX体系结构   从严格意义上说,可将操作系统定义为一种软件,它控制计算机硬件资源,提供程序运行环境.我们将这种软件称为内核(kernel),因为 它相对较小,且 ...

  9. 读高性能JavaScript编程 第一章

    草草的看完第一章,虽然看的是译文也是感觉涨姿势了, 我来总结一下: 由于 大多数浏览器都是 single process 处理 ui updatas and js execute 于是产生问题: js ...

随机推荐

  1. Clion = C/C++ 和 Python 共享的 IDE

    Clion + Tdmgcc + Winpython(Python)

  2. 基于TcpListener的web服务器

    写在前面 上篇文章根据<asp.net 本质论>书上提供的例子,实现了一个简单的web服务器,本篇文章将介绍另一种实现方式——基于TcpListener的web服务器. TcpListen ...

  3. fedora终端快捷键

    在name框中填写这个快捷键的名称,比如open terminal(打开终端窗口) 在command框中填写执行这个快捷键的shell命令,此处可填写gnome-terminal

  4. upc.2219: A^X mod P(打表 && 超越快速幂（in some ways)）

    2219: A^X mod P Time Limit: 5 Sec  Memory Limit: 128 MB Submit: 417  Solved: 68 [Submit][Status][Web ...

  5. BC.5200.Trees(dp)

    Trees  Accepts: 156  Submissions: 533  Time Limit: 2000/1000 MS (Java/Others)  Memory Limit: 65536/6 ...

  6. java web dao 层和dao 实现层有什么好处

    接口是为了屏蔽不同数据库的JDBC实现差异而出现的. 以常见的系统组织结构为例,管理系统里有一个部门department表用于存放部门信息,因为部门下面可能有子部门所以表中的字段要定义成类似树形结构的 ...

  7. Unity3D开发之NGUI点击事件穿透响应处理

    http://www.xuebuyuan.com/1936292.html 在使用NGUI 开发2D项目的时候,发现了一个问题,就是如果点出一个菜单,然后点击菜单上面的按钮的时候就会使得按钮下面的物品 ...

  8. hibernate.cfg.xml配置文件和hbm.xml配置文件 模板

    hibernate.cfg.xml配置文件格式 <?xml version="1.0" encoding="UTF-8"?><!DOCTYPE ...

  9. Resumable Media Uploads in the Google Data Protocol

    Eric Bidelman, Google Apps APIs team February 2010 Introduction The Resumable Protocol Initiating a ...

  10. JavaScript 使用 sort() 方法从数值上对数组进行排序

    使用 sort() 方法从数值上对数组进行排序. <html> <body> <script type="text/javascript"> f ...