ural 1197. Lonesome Knight

每次knight都能在水平或竖直方向移动两格，然后到向左或右偏移一格：

直接枚举：

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int N=8;
const int M='h'-'a'+1;

int solve(int x,int y){
    int cnt=0;

    if(x+2<=N){
        if(y-1>=1)
            cnt++;
        if(y+1<=M)
            cnt++;
    }

    if(x-2>=1){
      if(y-1>=1)
            cnt++;
        if(y+1<=M)
            cnt++;
    }

    if(y-2>=1){
        if(x+1<=N)
            cnt++;
        if(x-1>=1)
            cnt++;
    }
     if(y+2<=M){
        if(x+1<=N)
            cnt++;
        if(x-1>=1)
            cnt++;
    }
    return cnt;
}

int main(){
    int t;
    cin>>t;
    while(t--){
            cin.get();
        char ch;
        ch=getchar();
        int n;
        cin>>n;
        cout<<solve(n,ch-'a'+1)<<endl;
    }
}