CodeForces 710A King Moves(第一次打CF)

http://codeforces.com/contest/710/problem/A

A. King Moves
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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

题意:

给定坐标,判断“王”可以移动的位置个数。


思路:

模拟吧,貌似是水题。

我竟然先做的第二题!!!结果无限次卡。。。。。。。要不要睡觉,明天两场积分赛!


CODE:

#include<stdio.h>
#include<cstring>
#include<algorithm>
using namespace std;
const int MYDD=1103;

char k[2];
int main() {
//	while(1) {
		scanf("%s",k);
		if(strcmp(k,"a1")==0||strcmp(k,"a8")==0||strcmp(k,"h1")==0||strcmp(k,"h8")==0)
			puts("3");
		else if(k[0]=='a'||k[0]=='h'||k[1]=='1'||k[1]=='8')
			puts("5");
		else    puts("8");
//	}
	return 0;
}


评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值