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:
Lowest Common Ancestor
Pokermon League challenge
Divide Points
New Year and Ancient Prophecy
Flowers and Chocolate
Two Teams Composing
Curious Array
Kay and Eternity
Bracket Sequence
Game with Strings
Splitting the Uniqueness
Happy Line
Prince's Problem
Preparing for Merge Sort
Sliding Doors
Segments on the Line
Treap (Cartesian tree)
Cursor Distance
Longest increasing subsequence
Yuhao and a Parenthesis
Wilbur and Trees
Watchmen
Remainders Game
Decoding of Integer Sequences
Berland Elections
Yura and Developers
Equalize
Balls and Boxes
Submask Enumeration
Potions Homework
Dreamoon Likes Sequences
Looksery Party