snipt

Ctrl+h for KB shortcuts

C++

Codeforces 41 B - Game of chess unfinished

//============================================================================
// Name        : [email protected]	Game of chess unfinished
// Author      : LiJunLe
// Version     : Accepted
// Copyright   : Your copyright notice
// Description : http://www.codeforces.com/contest/42/problem/B
//============================================================================

#include <iostream>
#include <stdio.h>

using namespace std;

int dx[9] = {-1,-1,-1,+0,+0,+1,+1,+1, 0};
int dy[9] = {-1,+0,+1,-1,+1,-1,+0,+1, 0};

struct Point
{
    int x, y;

    Point (int _x=0, int _y=0) {
    	x = _x;
    	y = _y;
    }

    inline void getScanf()
    {
        char pos[3];
        scanf("%s", pos);
        x = pos[0] - 'a';
        y = pos[1] - '1';
    }

    bool operator==(Point o)
    {
        if (x == o.x && y == o.y)
        {
            return true;
        }
        else
        {
            return false;
        }
    }
};

Point rook[2], king[2];

bool rookHit(Point a, Point b)
{
    if (a.x == b.x)
    {
    	if (king[0].x == a.x) {
    		if (king[0].y < min(a.y, b.y) || king[0].y > max(a.y, b.y)) {
    			return true;
    		}
    	}
    	else {
    		return true;
    	}
    }
    if (a.y == b.y)
    {
    	if (king[0].y == a.y) {
    		if (king[0].x < min(a.x, b.x) || king[0].x > max(a.x, b.x)) {
    			return true;
    		}
    	}
    	else {
    		return true;
    	}
    }
    return false;
}

bool kingHit(Point a, Point b)
{
    for (int i = 0; i < 8; i++)
    {
        Point next(a.x + dx[i], a.y + dy[i]);
        if (next.x < 0 || next.x > 7 || next.y < 0 || next.y > 7)
        {
            continue;
        }
        if (next == b)
        {
            return true;
        }
    }
    return false;
}

int main()
{
    int i;
    for (i = 0; i < 2; i ++) {
        rook[i].getScanf();
    }
    for (i = 0; i < 2; i ++) {
        king[i].getScanf();
    }
    bool flag = true;
    for (i = 0; i < 9; i ++) {
		Point next(king[1].x + dx[i], king[1].y + dy[i]);
		if (next.x < 0 || next.x > 7 || next.y < 0 || next.y > 7)
		{
			continue;
		}
		for (int j = 0; j < 2; j ++) {
			if (next == rook[j]) {
				if (kingHit(king[0], next) == false && rookHit(rook[1-j], next) == false) {
					flag = false;
				}
			}
		}
		if (kingHit(king[0], next) == false &&
			rookHit(rook[0], next) == false &&
			rookHit(rook[1], next) == false) {
			flag = false;
		}
	}
    if (flag) {
        puts("CHECKMATE");
    }
    else {
        puts("OTHER");
    }
    return 0;
}
https://snipt.net/embed/e25ac90ac7d71d53e98032f52ff94d6d/
/raw/e25ac90ac7d71d53e98032f52ff94d6d/
e25ac90ac7d71d53e98032f52ff94d6d
cpp
C++
130
2019-07-20T10:04:03
True
False
False
/api/public/snipt/21352/
codeforces-41-b-game-of-chess-unfinished
<table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><a href="#L-1"> 1</a> <a href="#L-2"> 2</a> <a href="#L-3"> 3</a> <a href="#L-4"> 4</a> <a href="#L-5"> 5</a> <a href="#L-6"> 6</a> <a href="#L-7"> 7</a> <a href="#L-8"> 8</a> <a href="#L-9"> 9</a> <a href="#L-10"> 10</a> <a href="#L-11"> 11</a> <a href="#L-12"> 12</a> <a href="#L-13"> 13</a> <a href="#L-14"> 14</a> <a href="#L-15"> 15</a> <a href="#L-16"> 16</a> <a href="#L-17"> 17</a> <a href="#L-18"> 18</a> <a href="#L-19"> 19</a> <a href="#L-20"> 20</a> <a href="#L-21"> 21</a> <a href="#L-22"> 22</a> <a href="#L-23"> 23</a> <a href="#L-24"> 24</a> <a href="#L-25"> 25</a> <a href="#L-26"> 26</a> <a href="#L-27"> 27</a> <a href="#L-28"> 28</a> <a href="#L-29"> 29</a> <a href="#L-30"> 30</a> <a href="#L-31"> 31</a> <a href="#L-32"> 32</a> <a href="#L-33"> 33</a> <a href="#L-34"> 34</a> <a href="#L-35"> 35</a> <a href="#L-36"> 36</a> <a href="#L-37"> 37</a> <a href="#L-38"> 38</a> <a href="#L-39"> 39</a> <a href="#L-40"> 40</a> <a href="#L-41"> 41</a> <a href="#L-42"> 42</a> <a href="#L-43"> 43</a> <a href="#L-44"> 44</a> <a href="#L-45"> 45</a> <a href="#L-46"> 46</a> <a href="#L-47"> 47</a> <a href="#L-48"> 48</a> <a href="#L-49"> 49</a> <a href="#L-50"> 50</a> <a href="#L-51"> 51</a> <a href="#L-52"> 52</a> <a href="#L-53"> 53</a> <a href="#L-54"> 54</a> <a href="#L-55"> 55</a> <a href="#L-56"> 56</a> <a href="#L-57"> 57</a> <a href="#L-58"> 58</a> <a href="#L-59"> 59</a> <a href="#L-60"> 60</a> <a href="#L-61"> 61</a> <a href="#L-62"> 62</a> <a href="#L-63"> 63</a> <a href="#L-64"> 64</a> <a href="#L-65"> 65</a> <a href="#L-66"> 66</a> <a href="#L-67"> 67</a> <a href="#L-68"> 68</a> <a href="#L-69"> 69</a> <a href="#L-70"> 70</a> <a href="#L-71"> 71</a> <a href="#L-72"> 72</a> <a href="#L-73"> 73</a> <a href="#L-74"> 74</a> <a href="#L-75"> 75</a> <a href="#L-76"> 76</a> <a href="#L-77"> 77</a> <a href="#L-78"> 78</a> <a href="#L-79"> 79</a> <a href="#L-80"> 80</a> <a href="#L-81"> 81</a> <a href="#L-82"> 82</a> <a href="#L-83"> 83</a> <a href="#L-84"> 84</a> <a href="#L-85"> 85</a> <a href="#L-86"> 86</a> <a href="#L-87"> 87</a> <a href="#L-88"> 88</a> <a href="#L-89"> 89</a> <a href="#L-90"> 90</a> <a href="#L-91"> 91</a> <a href="#L-92"> 92</a> <a href="#L-93"> 93</a> <a href="#L-94"> 94</a> <a href="#L-95"> 95</a> <a href="#L-96"> 96</a> <a href="#L-97"> 97</a> <a href="#L-98"> 98</a> <a href="#L-99"> 99</a> <a href="#L-100">100</a> <a href="#L-101">101</a> <a href="#L-102">102</a> <a href="#L-103">103</a> <a href="#L-104">104</a> <a href="#L-105">105</a> <a href="#L-106">106</a> <a href="#L-107">107</a> <a href="#L-108">108</a> <a href="#L-109">109</a> <a href="#L-110">110</a> <a href="#L-111">111</a> <a href="#L-112">112</a> <a href="#L-113">113</a> <a href="#L-114">114</a> <a href="#L-115">115</a> <a href="#L-116">116</a> <a href="#L-117">117</a> <a href="#L-118">118</a> <a href="#L-119">119</a> <a href="#L-120">120</a> <a href="#L-121">121</a> <a href="#L-122">122</a> <a href="#L-123">123</a> <a href="#L-124">124</a> <a href="#L-125">125</a> <a href="#L-126">126</a> <a href="#L-127">127</a> <a href="#L-128">128</a> <a href="#L-129">129</a></pre></div></td><td class="code"><div class="highlight"><pre><span></span><span id="L-1"><a name="L-1"></a><span class="c1">//============================================================================</span> </span><span id="L-2"><a name="L-2"></a><span class="c1">// Name : [email protected] Game of chess unfinished</span> </span><span id="L-3"><a name="L-3"></a><span class="c1">// Author : LiJunLe</span> </span><span id="L-4"><a name="L-4"></a><span class="c1">// Version : Accepted</span> </span><span id="L-5"><a name="L-5"></a><span class="c1">// Copyright : Your copyright notice</span> </span><span id="L-6"><a name="L-6"></a><span class="c1">// Description : http://www.codeforces.com/contest/42/problem/B</span> </span><span id="L-7"><a name="L-7"></a><span class="c1">//============================================================================</span> </span><span id="L-8"><a name="L-8"></a> </span><span id="L-9"><a name="L-9"></a><span class="cp">#include</span> <span class="cpf">&lt;iostream&gt;</span><span class="cp"></span> </span><span id="L-10"><a name="L-10"></a><span class="cp">#include</span> <span class="cpf">&lt;stdio.h&gt;</span><span class="cp"></span> </span><span id="L-11"><a name="L-11"></a> </span><span id="L-12"><a name="L-12"></a><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span> </span><span id="L-13"><a name="L-13"></a> </span><span id="L-14"><a name="L-14"></a><span class="kt">int</span> <span class="n">dx</span><span class="p">[</span><span class="mi">9</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span><span class="o">+</span><span class="mi">0</span><span class="p">,</span><span class="o">+</span><span class="mi">0</span><span class="p">,</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">};</span> </span><span id="L-15"><a name="L-15"></a><span class="kt">int</span> <span class="n">dy</span><span class="p">[</span><span class="mi">9</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span><span class="o">+</span><span class="mi">0</span><span class="p">,</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span><span class="o">+</span><span class="mi">0</span><span class="p">,</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">};</span> </span><span id="L-16"><a name="L-16"></a> </span><span id="L-17"><a name="L-17"></a><span class="k">struct</span> <span class="n">Point</span> </span><span id="L-18"><a name="L-18"></a><span class="p">{</span> </span><span id="L-19"><a name="L-19"></a> <span class="kt">int</span> <span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">;</span> </span><span id="L-20"><a name="L-20"></a> </span><span id="L-21"><a name="L-21"></a> <span class="n">Point</span> <span class="p">(</span><span class="kt">int</span> <span class="n">_x</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="kt">int</span> <span class="n">_y</span><span class="o">=</span><span class="mi">0</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-22"><a name="L-22"></a> <span class="n">x</span> <span class="o">=</span> <span class="n">_x</span><span class="p">;</span> </span><span id="L-23"><a name="L-23"></a> <span class="n">y</span> <span class="o">=</span> <span class="n">_y</span><span class="p">;</span> </span><span id="L-24"><a name="L-24"></a> <span class="p">}</span> </span><span id="L-25"><a name="L-25"></a> </span><span id="L-26"><a name="L-26"></a> <span class="kr">inline</span> <span class="kt">void</span> <span class="n">getScanf</span><span class="p">()</span> </span><span id="L-27"><a name="L-27"></a> <span class="p">{</span> </span><span id="L-28"><a name="L-28"></a> <span class="kt">char</span> <span class="n">pos</span><span class="p">[</span><span class="mi">3</span><span class="p">];</span> </span><span id="L-29"><a name="L-29"></a> <span class="n">scanf</span><span class="p">(</span><span class="s">&quot;%s&quot;</span><span class="p">,</span> <span class="n">pos</span><span class="p">);</span> </span><span id="L-30"><a name="L-30"></a> <span class="n">x</span> <span class="o">=</span> <span class="n">pos</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">-</span> <span class="sc">&#39;a&#39;</span><span class="p">;</span> </span><span id="L-31"><a name="L-31"></a> <span class="n">y</span> <span class="o">=</span> <span class="n">pos</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span> <span class="o">-</span> <span class="sc">&#39;1&#39;</span><span class="p">;</span> </span><span id="L-32"><a name="L-32"></a> <span class="p">}</span> </span><span id="L-33"><a name="L-33"></a> </span><span id="L-34"><a name="L-34"></a> <span class="kt">bool</span> <span class="k">operator</span><span class="o">==</span><span class="p">(</span><span class="n">Point</span> <span class="n">o</span><span class="p">)</span> </span><span id="L-35"><a name="L-35"></a> <span class="p">{</span> </span><span id="L-36"><a name="L-36"></a> <span class="k">if</span> <span class="p">(</span><span class="n">x</span> <span class="o">==</span> <span class="n">o</span><span class="p">.</span><span class="n">x</span> <span class="o">&amp;&amp;</span> <span class="n">y</span> <span class="o">==</span> <span class="n">o</span><span class="p">.</span><span class="n">y</span><span class="p">)</span> </span><span id="L-37"><a name="L-37"></a> <span class="p">{</span> </span><span id="L-38"><a name="L-38"></a> <span class="k">return</span> <span class="nb">true</span><span class="p">;</span> </span><span id="L-39"><a name="L-39"></a> <span class="p">}</span> </span><span id="L-40"><a name="L-40"></a> <span class="k">else</span> </span><span id="L-41"><a name="L-41"></a> <span class="p">{</span> </span><span id="L-42"><a name="L-42"></a> <span class="k">return</span> <span class="nb">false</span><span class="p">;</span> </span><span id="L-43"><a name="L-43"></a> <span class="p">}</span> </span><span id="L-44"><a name="L-44"></a> <span class="p">}</span> </span><span id="L-45"><a name="L-45"></a><span class="p">};</span> </span><span id="L-46"><a name="L-46"></a> </span><span id="L-47"><a name="L-47"></a><span class="n">Point</span> <span class="n">rook</span><span class="p">[</span><span class="mi">2</span><span class="p">],</span> <span class="n">king</span><span class="p">[</span><span class="mi">2</span><span class="p">];</span> </span><span id="L-48"><a name="L-48"></a> </span><span id="L-49"><a name="L-49"></a><span class="kt">bool</span> <span class="nf">rookHit</span><span class="p">(</span><span class="n">Point</span> <span class="n">a</span><span class="p">,</span> <span class="n">Point</span> <span class="n">b</span><span class="p">)</span> </span><span id="L-50"><a name="L-50"></a><span class="p">{</span> </span><span id="L-51"><a name="L-51"></a> <span class="k">if</span> <span class="p">(</span><span class="n">a</span><span class="p">.</span><span class="n">x</span> <span class="o">==</span> <span class="n">b</span><span class="p">.</span><span class="n">x</span><span class="p">)</span> </span><span id="L-52"><a name="L-52"></a> <span class="p">{</span> </span><span id="L-53"><a name="L-53"></a> <span class="k">if</span> <span class="p">(</span><span class="n">king</span><span class="p">[</span><span class="mi">0</span><span class="p">].</span><span class="n">x</span> <span class="o">==</span> <span class="n">a</span><span class="p">.</span><span class="n">x</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-54"><a name="L-54"></a> <span class="k">if</span> <span class="p">(</span><span class="n">king</span><span class="p">[</span><span class="mi">0</span><span class="p">].</span><span class="n">y</span> <span class="o">&lt;</span> <span class="n">min</span><span class="p">(</span><span class="n">a</span><span class="p">.</span><span class="n">y</span><span class="p">,</span> <span class="n">b</span><span class="p">.</span><span class="n">y</span><span class="p">)</span> <span class="o">||</span> <span class="n">king</span><span class="p">[</span><span class="mi">0</span><span class="p">].</span><span class="n">y</span> <span class="o">&gt;</span> <span class="n">max</span><span class="p">(</span><span class="n">a</span><span class="p">.</span><span class="n">y</span><span class="p">,</span> <span class="n">b</span><span class="p">.</span><span class="n">y</span><span class="p">))</span> <span class="p">{</span> </span><span id="L-55"><a name="L-55"></a> <span class="k">return</span> <span class="nb">true</span><span class="p">;</span> </span><span id="L-56"><a name="L-56"></a> <span class="p">}</span> </span><span id="L-57"><a name="L-57"></a> <span class="p">}</span> </span><span id="L-58"><a name="L-58"></a> <span class="k">else</span> <span class="p">{</span> </span><span id="L-59"><a name="L-59"></a> <span class="k">return</span> <span class="nb">true</span><span class="p">;</span> </span><span id="L-60"><a name="L-60"></a> <span class="p">}</span> </span><span id="L-61"><a name="L-61"></a> <span class="p">}</span> </span><span id="L-62"><a name="L-62"></a> <span class="k">if</span> <span class="p">(</span><span class="n">a</span><span class="p">.</span><span class="n">y</span> <span class="o">==</span> <span class="n">b</span><span class="p">.</span><span class="n">y</span><span class="p">)</span> </span><span id="L-63"><a name="L-63"></a> <span class="p">{</span> </span><span id="L-64"><a name="L-64"></a> <span class="k">if</span> <span class="p">(</span><span class="n">king</span><span class="p">[</span><span class="mi">0</span><span class="p">].</span><span class="n">y</span> <span class="o">==</span> <span class="n">a</span><span class="p">.</span><span class="n">y</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-65"><a name="L-65"></a> <span class="k">if</span> <span class="p">(</span><span class="n">king</span><span class="p">[</span><span class="mi">0</span><span class="p">].</span><span class="n">x</span> <span class="o">&lt;</span> <span class="n">min</span><span class="p">(</span><span class="n">a</span><span class="p">.</span><span class="n">x</span><span class="p">,</span> <span class="n">b</span><span class="p">.</span><span class="n">x</span><span class="p">)</span> <span class="o">||</span> <span class="n">king</span><span class="p">[</span><span class="mi">0</span><span class="p">].</span><span class="n">x</span> <span class="o">&gt;</span> <span class="n">max</span><span class="p">(</span><span class="n">a</span><span class="p">.</span><span class="n">x</span><span class="p">,</span> <span class="n">b</span><span class="p">.</span><span class="n">x</span><span class="p">))</span> <span class="p">{</span> </span><span id="L-66"><a name="L-66"></a> <span class="k">return</span> <span class="nb">true</span><span class="p">;</span> </span><span id="L-67"><a name="L-67"></a> <span class="p">}</span> </span><span id="L-68"><a name="L-68"></a> <span class="p">}</span> </span><span id="L-69"><a name="L-69"></a> <span class="k">else</span> <span class="p">{</span> </span><span id="L-70"><a name="L-70"></a> <span class="k">return</span> <span class="nb">true</span><span class="p">;</span> </span><span id="L-71"><a name="L-71"></a> <span class="p">}</span> </span><span id="L-72"><a name="L-72"></a> <span class="p">}</span> </span><span id="L-73"><a name="L-73"></a> <span class="k">return</span> <span class="nb">false</span><span class="p">;</span> </span><span id="L-74"><a name="L-74"></a><span class="p">}</span> </span><span id="L-75"><a name="L-75"></a> </span><span id="L-76"><a name="L-76"></a><span class="kt">bool</span> <span class="nf">kingHit</span><span class="p">(</span><span class="n">Point</span> <span class="n">a</span><span class="p">,</span> <span class="n">Point</span> <span class="n">b</span><span class="p">)</span> </span><span id="L-77"><a name="L-77"></a><span class="p">{</span> </span><span id="L-78"><a name="L-78"></a> <span class="k">for</span> <span class="p">(</span><span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="mi">8</span><span class="p">;</span> <span class="n">i</span><span class="o">++</span><span class="p">)</span> </span><span id="L-79"><a name="L-79"></a> <span class="p">{</span> </span><span id="L-80"><a name="L-80"></a> <span class="n">Point</span> <span class="n">next</span><span class="p">(</span><span class="n">a</span><span class="p">.</span><span class="n">x</span> <span class="o">+</span> <span class="n">dx</span><span class="p">[</span><span class="n">i</span><span class="p">],</span> <span class="n">a</span><span class="p">.</span><span class="n">y</span> <span class="o">+</span> <span class="n">dy</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span> </span><span id="L-81"><a name="L-81"></a> <span class="k">if</span> <span class="p">(</span><span class="n">next</span><span class="p">.</span><span class="n">x</span> <span class="o">&lt;</span> <span class="mi">0</span> <span class="o">||</span> <span class="n">next</span><span class="p">.</span><span class="n">x</span> <span class="o">&gt;</span> <span class="mi">7</span> <span class="o">||</span> <span class="n">next</span><span class="p">.</span><span class="n">y</span> <span class="o">&lt;</span> <span class="mi">0</span> <span class="o">||</span> <span class="n">next</span><span class="p">.</span><span class="n">y</span> <span class="o">&gt;</span> <span class="mi">7</span><span class="p">)</span> </span><span id="L-82"><a name="L-82"></a> <span class="p">{</span> </span><span id="L-83"><a name="L-83"></a> <span class="k">continue</span><span class="p">;</span> </span><span id="L-84"><a name="L-84"></a> <span class="p">}</span> </span><span id="L-85"><a name="L-85"></a> <span class="k">if</span> <span class="p">(</span><span class="n">next</span> <span class="o">==</span> <span class="n">b</span><span class="p">)</span> </span><span id="L-86"><a name="L-86"></a> <span class="p">{</span> </span><span id="L-87"><a name="L-87"></a> <span class="k">return</span> <span class="nb">true</span><span class="p">;</span> </span><span id="L-88"><a name="L-88"></a> <span class="p">}</span> </span><span id="L-89"><a name="L-89"></a> <span class="p">}</span> </span><span id="L-90"><a name="L-90"></a> <span class="k">return</span> <span class="nb">false</span><span class="p">;</span> </span><span id="L-91"><a name="L-91"></a><span class="p">}</span> </span><span id="L-92"><a name="L-92"></a> </span><span id="L-93"><a name="L-93"></a><span class="kt">int</span> <span class="nf">main</span><span class="p">()</span> </span><span id="L-94"><a name="L-94"></a><span class="p">{</span> </span><span id="L-95"><a name="L-95"></a> <span class="kt">int</span> <span class="n">i</span><span class="p">;</span> </span><span id="L-96"><a name="L-96"></a> <span class="k">for</span> <span class="p">(</span><span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="mi">2</span><span class="p">;</span> <span class="n">i</span> <span class="o">++</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-97"><a name="L-97"></a> <span class="n">rook</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">getScanf</span><span class="p">();</span> </span><span id="L-98"><a name="L-98"></a> <span class="p">}</span> </span><span id="L-99"><a name="L-99"></a> <span class="k">for</span> <span class="p">(</span><span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="mi">2</span><span class="p">;</span> <span class="n">i</span> <span class="o">++</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-100"><a name="L-100"></a> <span class="n">king</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">getScanf</span><span class="p">();</span> </span><span id="L-101"><a name="L-101"></a> <span class="p">}</span> </span><span id="L-102"><a name="L-102"></a> <span class="kt">bool</span> <span class="n">flag</span> <span class="o">=</span> <span class="nb">true</span><span class="p">;</span> </span><span id="L-103"><a name="L-103"></a> <span class="k">for</span> <span class="p">(</span><span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="mi">9</span><span class="p">;</span> <span class="n">i</span> <span class="o">++</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-104"><a name="L-104"></a> <span class="n">Point</span> <span class="n">next</span><span class="p">(</span><span class="n">king</span><span class="p">[</span><span class="mi">1</span><span class="p">].</span><span class="n">x</span> <span class="o">+</span> <span class="n">dx</span><span class="p">[</span><span class="n">i</span><span class="p">],</span> <span class="n">king</span><span class="p">[</span><span class="mi">1</span><span class="p">].</span><span class="n">y</span> <span class="o">+</span> <span class="n">dy</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span> </span><span id="L-105"><a name="L-105"></a> <span class="k">if</span> <span class="p">(</span><span class="n">next</span><span class="p">.</span><span class="n">x</span> <span class="o">&lt;</span> <span class="mi">0</span> <span class="o">||</span> <span class="n">next</span><span class="p">.</span><span class="n">x</span> <span class="o">&gt;</span> <span class="mi">7</span> <span class="o">||</span> <span class="n">next</span><span class="p">.</span><span class="n">y</span> <span class="o">&lt;</span> <span class="mi">0</span> <span class="o">||</span> <span class="n">next</span><span class="p">.</span><span class="n">y</span> <span class="o">&gt;</span> <span class="mi">7</span><span class="p">)</span> </span><span id="L-106"><a name="L-106"></a> <span class="p">{</span> </span><span id="L-107"><a name="L-107"></a> <span class="k">continue</span><span class="p">;</span> </span><span id="L-108"><a name="L-108"></a> <span class="p">}</span> </span><span id="L-109"><a name="L-109"></a> <span class="k">for</span> <span class="p">(</span><span class="kt">int</span> <span class="n">j</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">j</span> <span class="o">&lt;</span> <span class="mi">2</span><span class="p">;</span> <span class="n">j</span> <span class="o">++</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-110"><a name="L-110"></a> <span class="k">if</span> <span class="p">(</span><span class="n">next</span> <span class="o">==</span> <span class="n">rook</span><span class="p">[</span><span class="n">j</span><span class="p">])</span> <span class="p">{</span> </span><span id="L-111"><a name="L-111"></a> <span class="k">if</span> <span class="p">(</span><span class="n">kingHit</span><span class="p">(</span><span class="n">king</span><span class="p">[</span><span class="mi">0</span><span class="p">],</span> <span class="n">next</span><span class="p">)</span> <span class="o">==</span> <span class="nb">false</span> <span class="o">&amp;&amp;</span> <span class="n">rookHit</span><span class="p">(</span><span class="n">rook</span><span class="p">[</span><span class="mi">1</span><span class="o">-</span><span class="n">j</span><span class="p">],</span> <span class="n">next</span><span class="p">)</span> <span class="o">==</span> <span class="nb">false</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-112"><a name="L-112"></a> <span class="n">flag</span> <span class="o">=</span> <span class="nb">false</span><span class="p">;</span> </span><span id="L-113"><a name="L-113"></a> <span class="p">}</span> </span><span id="L-114"><a name="L-114"></a> <span class="p">}</span> </span><span id="L-115"><a name="L-115"></a> <span class="p">}</span> </span><span id="L-116"><a name="L-116"></a> <span class="k">if</span> <span class="p">(</span><span class="n">kingHit</span><span class="p">(</span><span class="n">king</span><span class="p">[</span><span class="mi">0</span><span class="p">],</span> <span class="n">next</span><span class="p">)</span> <span class="o">==</span> <span class="nb">false</span> <span class="o">&amp;&amp;</span> </span><span id="L-117"><a name="L-117"></a> <span class="n">rookHit</span><span class="p">(</span><span class="n">rook</span><span class="p">[</span><span class="mi">0</span><span class="p">],</span> <span class="n">next</span><span class="p">)</span> <span class="o">==</span> <span class="nb">false</span> <span class="o">&amp;&amp;</span> </span><span id="L-118"><a name="L-118"></a> <span class="n">rookHit</span><span class="p">(</span><span class="n">rook</span><span class="p">[</span><span class="mi">1</span><span class="p">],</span> <span class="n">next</span><span class="p">)</span> <span class="o">==</span> <span class="nb">false</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-119"><a name="L-119"></a> <span class="n">flag</span> <span class="o">=</span> <span class="nb">false</span><span class="p">;</span> </span><span id="L-120"><a name="L-120"></a> <span class="p">}</span> </span><span id="L-121"><a name="L-121"></a> <span class="p">}</span> </span><span id="L-122"><a name="L-122"></a> <span class="k">if</span> <span class="p">(</span><span class="n">flag</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-123"><a name="L-123"></a> <span class="n">puts</span><span class="p">(</span><span class="s">&quot;CHECKMATE&quot;</span><span class="p">);</span> </span><span id="L-124"><a name="L-124"></a> <span class="p">}</span> </span><span id="L-125"><a name="L-125"></a> <span class="k">else</span> <span class="p">{</span> </span><span id="L-126"><a name="L-126"></a> <span class="n">puts</span><span class="p">(</span><span class="s">&quot;OTHER&quot;</span><span class="p">);</span> </span><span id="L-127"><a name="L-127"></a> <span class="p">}</span> </span><span id="L-128"><a name="L-128"></a> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> </span><span id="L-129"><a name="L-129"></a><span class="p">}</span> </span></pre></div> </td></tr></table>
41, b, cf, chess, game, unfinished