POJ1657 Distance on chessboard

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;

int main()
{
int n;
cin >> n;
while(n--) {
char b, e;
int B, E;
cin >> b >> B >> e >> E;
int keen, queen, car, ele;
int x, y;
x = abs(b - e);
y = abs(B - E);
if(x == y && y == 0) {
keen = 0; queen = 0; car = 0; ele = 0;
}
else {
if(x < y) keen = y;
else keen = x;
if(x == y || x == 0 || y == 0) queen = 1;
else queen = 2;
if(x == 0 || y == 0) car = 1;
else car = 2;
if((x - y) % 2 != 0) ele = -1;
else if(x == y) ele = 1;
else ele = 2;
}
if(ele == -1) {
printf("%d %d %d Inf\n", keen, queen, car);
} else {
printf("%d %d %d %d\n", keen, queen, car, ele);
}
}
return 0;
}

内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理

• 添加评论
• 分享网址
• 分享文章
• 返回顶部