Codeforces刷题之路——710A King Moves_the only king stands on the standard chess board. -优快云博客

本文介绍了一道关于国际象棋中王的走法的编程题，详细解释了不同位置下王的合法走法数量，并提供了一段Java代码作为解答。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

    Example 
  
      input 
    
e4

      output 
    
8

题目大意：给出标准国际象棋王所在的坐标，求出其一步能够走的格子有多少种情况。

不清楚国际象棋规则的，我可以在这简单介绍一下（我也是因为这道题才学会国际象棋的规则）国际象棋中，king这个棋子每次只能走一步，即上、下、左、右、斜左上、斜左下、斜右上、斜右下均能走。见上图那些XXXX的位置。

解题思路：理解了题意，其实就很简单了，无非三种情况：

1）4个顶角=3

2）四条边界=5

3）其他 = 8

以下为解题代码（java实现）

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(System.in);
		String string = scanner.nextLine();
		char column = string.charAt(0);
		char row = string.charAt(1);
		int R = Integer.parseInt(string.substring(1));
		
		if((column == 'a' && R == 1) || (column == 'h' && R == 8) || (column == 'a' && R == 8) || (column == 'h' && R == 1)){
			System.out.println(3);
		}else if(column == 'a' || column == 'h' || R == 1 || R == 8){
			System.out.println(5);
		}else{
			System.out.println(8);
		}
	}
}