csu 入门题 棋局

Description

Input
输入包含不超过10000 组数据。每组数据包含6个整数r1, c1, r2, c2, r3, c3 (1<=r1, c1, r2, c2, r3, c3<=8). 三个格子A, B, C保证各不相同。

Output
对于每组数据，输出测试点编号和最少步数。

#include <iostream>
#include <cmath>
int max(int, int);
using namespace std;
int main()
{
    int c = 1;
    int a1, a2, b1, b2, c1, c2,a,b;
    while (cin>>a1>>a2>>b1>>b2>>c1>>c2)
    {
        int a, b;
        a = abs(a1 - b1);
        b = abs(a2 - b2);
        if (a == b&& (c2 > a2&&c2<b2 || c2>b2&&c2 < a2) &&(c1 > a1&&c1<b1 || c1>b1&&c1 < a1)&&(c1-a1)==(c2-a2))
            cout<<"Case "<<c<<": " << a + 1 << endl;
        else cout << "Case " << c << ": " << max(a, b) << endl;
        c++;
    }

}
int max(int a, int b)
{
    int c = a > b ? a : b;
    return c;
}