Educational Codeforces Round 16 A. King Moves【模拟】

A. King Moves
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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
原题链接:http://codeforces.com/contest/710/problem/A

题意:在国际象棋上,给你将的位置,问你它可以走多少个方向。

AC代码:

#include <bits/stdc++.h>
using namespace std ;
int main()
{
    char a[5];
    while(cin>>a)
    {
        int x=a[0]-'a'+1;
        int y=a[1]-'0';
        if(x==1&&y==1||x==8&&y==8||x==1&&y==8||x==8&&y==1)//4个角
            cout<<"3"<<endl;
        else if((x==1||x==8)&&(x!=1||y!=8))//边上(除了角)
            cout<<"5"<<endl;
        else if((y==1||y==8)&&(x!=1||x!=8))//边上(除了角)
            cout<<"5"<<endl;
        else
            cout<<"8"<<endl;
    }
    return 0;
}

标程代码:

#include <bits/stdc++.h>
using namespace std ;
int main()
{
    char a,b;
    while(cin>>a>>b)
    {
        int cnt=0;
        if(a=='a'||a=='h')
            cnt++;
        if(b=='1'||b=='8')
            cnt++;
        if(cnt==0)
            puts("8");
        else if(cnt==1)
            puts("5");
        else if(cnt==2)
            puts("3");
    }
    return 0;
}


尊重原创,转载请注明出处:http://blog.csdn.net/hurmishine

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值