题目链接:https://codeforces.ml/problemset/problem/459/A
题目大意:给你正方形两个点的坐标,找出另外两个点的坐标,且这个正方形要平行于坐标轴;
题解:判断给的两个点是什么情况,只有2种:相邻和对角;然后判断有没有平行于坐标轴;
代码:
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
//同一边
if (x1 == x2 && y1 != y2)
{
cout << x1 + y2 - y1<<" "<<y1
<< " " << x2 + y2 - y1 << " " << y2 << endl;
}
else if (x1 != x2 && y1 == y2)
{
cout << x1 << " " << y1 + x2 - x1
<< " " << x2 << " " << y2 + x2 - x1 << endl;
}
//不同边
else
{
//对角
if (abs(y1 - y2) == abs(x2 - x1) && y1 != y2)
{
cout << x1 << " " << y2 << " " << x2 << " " << y1 << endl;
}
else
cout << -1 << endl;
}
}