【CodeForces】〖 Educational Codeforces Round 16〗A. King Moves

「已注销」

于 2016-08-23 16:13:54 发布

阅读量537

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 CodeForces 文章标签： codeforces 算法

本文链接：https://blog.youkuaiyun.com/LeongHouHeng/article/details/52291904

算法同时被 2 个专栏收录

68 篇文章

订阅专栏

CodeForces

14 篇文章

订阅专栏

本文介绍了一个简单的程序，该程序用于计算国际象棋中处于特定位置的王可以进行的有效移动数量。根据输入的位置，程序将输出王可能的所有合法移动步骤数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem here

Problem

The only king stands on the standard chess board. You are given his position in format “cd”, where c is the column from ‘a’ to ‘h’ and d is the row from ‘1’ to ‘8’. Find the number of moves permitted for the king.

Check the king’s moves here https://en.wikipedia.org/wiki/King_(chess).
这里写图片描述
King moves from the position e4

Input

The only line contains the king’s position in the format “cd”, where ‘c’ is the column from ‘a’ to ‘h’ and ‘d’ is the row from ‘1’ to ‘8’.

Output

Print the only integer x — the number of moves permitted for the king.

Example

input
e4
output
8

Solution

#include <iostream>
#include <memory.h>
using namespace std;


int main(){
    char cc;
    int c, d, ans = 0;
    cin >> cc >> d;
    cc -= 48;
    c = cc - '0';
    if(c + 1 <= 8 && c + 1 > 0){
        ans++;
        if(d+1 > 0 && d+1 <= 8)
            ans++;
        if(d-1 > 0 && d-1 <= 8)
            ans++;
    }
    if(c - 1 <= 8 && c - 1 > 0){
        ans++;
        if(d+1 > 0 && d+1 <= 8)
            ans++;
        if(d-1 > 0 && d-1 <= 8)
            ans++;
    }
    if(d + 1 > 0 && d + 1 <= 8)
        ans++;
    if(d - 1 > 0 && d - 1 <= 8)
        ans++;

    cout << ans << endl;

    return 0;
}