CodeForces 710A King Moves

简单题。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<iostream>
using namespace std;
typedef long long LL;
const double pi=acos(-1.0),eps=1e-8;

char s[5],R,C,ans;

bool check(int a,int b)
{
    if(a>=1&&a<=8&&b>=1&&b<=8) return 1;
    return 0;
}
int main()
{
    scanf("%s",s);
    R=s[1]-'0'; C=s[0]-'a'+1;
    ans=0;

    if(check(R-1,C-1)) ans++;
    if(check(R-1,C)) ans++;
    if(check(R-1,C+1)) ans++;
    if(check(R,C-1)) ans++;
    if(check(R,C+1)) ans++;
    if(check(R+1,C-1)) ans++;
    if(check(R+1,C)) ans++;
    if(check(R+1,C+1)) ans++;

    printf("%d\n",ans);
    return 0;
}