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 <bits/stdc++.h>
using namespace std;
int main() {
char s[42];
scanf("%s", s);
int x, y;
if (s[0] == 'a' || s[0] == 'h') {
x = 2;
} else {
x = 3;
}
if (s[1] == '1' || s[1] == '8') {
y = 2;
} else {
y = 3;
}
printf("%d\n", x * y - 1);
return 0;
}
Related posts:
Scheduling jobs on one machine
Gray code
Bad Days
Sereja and Algorithm
Fibonacci-ish
Fox and Card Game
Design Tutorial: Make It Nondeterministic
Developing Game
Fast Fourier transform
New Year and Cleaning
Potions Homework
Maze
Fish Weight
K-Complete Word
PolandBall and Many Other Balls
Golden System
Alternating Current
Perfect Triples
Alyona and a Narrow Fridge
The Tower is Going Home
Giải Thuật Và Lập Trình - Lê Minh Hoàng
Movie Fan
Cards
Cheap Travel
Cartoons
Challenging Balloons
Aroma's Search
Prefix function. Knuth–Morris–Pratt algorithm
Suffix Array
Playing with Permutations
Berland Miners
Parallel Programming