Timus : 1197 (Lonesome Knight)



// http://acm.timus.ru/problem.aspx?space=1&num=1197
// Runtime: 0.015s
// Tag: Adhoc


// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>

#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define pi acos(-1.0)
#define N 1000000
#define LL long long

#define For(i, a, b) for( int i = (a); i < (b); i++ )
#define Fors(i, sz) for( size_t i = 0; i < sz.size (); i++ )
#define Fore(it, x) for(typeof (x.begin()) it = x.begin(); it != x.end (); it++)
#define Set(a, s) memset(a, s, sizeof (a))
#define Read(r) freopen(r, "r", stdin)
#define Write(w) freopen(w, "w", stdout)

using namespace std;

int main ()
{
    int testCase;
    scanf ("%d", &testCase);

    while ( testCase-- ) {
        char inp [5];
        scanf ("%s", inp);

        int r = inp [0] - 'a';
        int c = inp [1] - '1';

        int dr [] = {-2, -2, 1, -1, 2, 2, 1, -1};
        int dc [] = {1, -1, 2, 2, 1, -1, -2, -2};

        int cnt = 0;

        for ( int i = 0; i < 8; i++ ) {
            if ( !(r + dr [i] < 0 || r + dr [i] > 7 || c + dc [i] < 0 || c + dc [i] > 7) ) cnt++;
        }

        printf ("%d\n", cnt);
    }

	return 0;
}

// @END_OF_SOURCE_CODE

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s