codeforces710A--King Moves水

最新推荐文章于 2017-03-31 19:53:06 发布

原创最新推荐文章于 2017-03-31 19:53:06 发布 · 246 阅读

0 ·

CC 4.0 BY-SA版权

编程语言同时被 2 个专栏收录

307 篇文章

订阅专栏

codeforces

76 篇文章

订阅专栏

本文介绍了一个简单的程序，用于确定国际象棋中王的合法移动数量。通过输入王的位置，程序能够计算出根据标准国际象棋规则王可以从当前位置进行的所有合法移动数。

D - King Moves

Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 710A

Appoint description:

Description

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).

$\text{[math]}$ 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.

Sample Input

Input

e4

Output

可以走多少步（周围有多少格）

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
	char s[3];
	while(~scanf("%s",&s))
	{

		 if(s[1]=='8'||s[1]=='1')
		 {
		 	if(s[0]=='a'||s[0]=='h')
		 	printf("3\n");
		 	else
		 	printf("5\n");
		 }
		 else if(s[0]=='a'||s[0]=='h')
		 {
		 	if(s[1]=='1'||s[1]=='8')
		 	printf("3\n");
		 	else
		 	printf("5\n");
		 }
		 else
		 printf("8\n");
		 
		
	}
}