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:
The Chocolate Spree
New Year and Fireworks
Wise Men (Easy Version)
New Year and Castle Construction
Elections
Developing Game
New Year and Naming
New Year Tree
Chain Reaction
Little Artem and Time Machine
Limak and Shooting Points
Useful Decomposition
Noise Level
Rotate Columns (hard version)
Cheap Travel
Tài liệu giáo khoa chuyên Tin 3 quyển
Welfare State
Dima and Two Sequences
Monopole Magnets
New Year Santa Network
Heroes of Making Magic III
Fibonacci-ish II
Big Problems for Organizers
Check if two segments intersect
Wilbur and Swimming Pool
New Year Tree Decorations
Finding the equation of a line for a segment
String Set Queries
Koala and Notebook
Preparing for Merge Sort
Finding strongly connected components - Building condensation graph
Rock Is Push