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:
Scaygerboss
Security
Summer Homework
Prefix-Suffix Palindrome (Hard version)
Second best Minimum Spanning Tree - Using Kruskal and Lowest Common Ancestor
New Year and Domino
PolandBall and Gifts
Train Hard, Win Easy
The Values You Can Make
New Year and Cleaning
Fence
Limericks
Cube Problem
Tree and XOR
Spy Syndrome 2
Optimal Subsequences (Hard Version)
World Eater Brothers
Square Difference
Molly's Chemicals
Ancient Prophesy
SMSC
The Holmes Children
Magic Grid
Kuroni and Simple Strings
Students Initiation
15 Puzzle Game: Existence Of The Solution
Bear and Displayed Friends
The Door Problem
Photo to Remember
Businessmen Problems
Permutation Game
Hydra