Codeforces Round #261 (Div. 2)A. Pashmak and Garden

#include <iostream>#include <string>#include <cstring>#include <algorithm>#include <cmath>#include <vector>#include <list>#include <deque>using namespace std;const double eps = 1e-8;int x1, x2, x3, x4, y11, y2, y3, y4, r;bool flag;void solve(){    flag = false;    if (x1 == x2) {        r = fabs(y11 - y2);        x3 = x1 +r;        y3 = y11;        x4 = x3, y4 = y2;        flag = true;    }    else if (y11 == y2) {        r = fabs(x1 - x2);        x3 = x1;        y3 = y11 + r;        y4 = y3, x4 = x2;        flag = true;    }    else if (fabs(x1 - x2) == fabs(y11 - y2)) {        x3 = x1, y3 = y2;        x4 = x2, y4 = y11;        flag = true;    }    else        flag = false;}void print(){    if (flag)        cout << x3 << " " << y3 << " " << x4 << " " << y4 << endl;    else        cout << "-1" << endl;}int main(){    while (cin >> x1 >> y11 >> x2 >> y2) {        solve();        print();    }    return 0;}