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:
Yuhao and a Parenthesis
Orac and Game of Life
Graph Decomposition
K Paths
Falling Blocks
Festival Organization
Preparing for the Contest
Finding bridges in a graph in $O(N+M)$
Alice and Hairdresser
Cursor Distance
Maximum Reduction
Wilbur and Strings
Three strings
Hot is Cold
Parliament of Berland
Candies and Two Sisters
Molly's Chemicals
Scheduling jobs on one machine
Sqrt Tree
Princesses and Princes
Cow and Snacks
Graph Coloring
Mind Control
Cartoons
Strange Function
Solve RMQ (Range Minimum Query) by finding LCA (Lowest Common Ancestor)
K-th order statistic in O(N)
Transmitting Levels
Chip Game
Integer factorization
New Year and the Acquaintance Estimation
Triangle