#include <bits/stdc++.h>

using namespace std;

//****************************************************************
// HackerRank Prepare > Mathematics > Fundamentals: Find the Point
//****************************************************************

// point reflection. 180° rotation of point p around q to point r
vector<int> findPoint(int px, int py, int qx, int qy) {
    // rx – qx = qx – px
    // ry – qy = qy – py
    // rx = 2qx - px
    // ry = 2qy - py
    int rx = 2 * qx - px;
    int ry = 2 * qy - py;
    vector<int> result{rx,ry};
    return result;
}

int main()
{
    vector<tuple<vector<int>,vector<int>,vector<int>>> testCases = {
        // px py   qx qy   rx ry
        { {0, 0}, {1, 1}, {2, 2} },
        { {1, 1}, {2, 2}, {3, 3} },
    };

    for (auto test: testCases)
    {
        vector<int>& p= get<0>(test);
        vector<int>& q = get<1>(test);
        vector<int> r = findPoint(p.at(0), p.at(1),
                                  q.at(0), q.at(1));        
        vector<int>& expected = get<2>(test);

        for (auto i: p) { cout << i << " "; } cout << endl;
        for (auto i: q) { cout << i << " "; } cout << endl;
        for (auto i: r) { cout << i << " "; } cout << endl;
        for (auto i: expected) { cout << i << " "; } cout << endl;
        cout <<"----------\n";        
    }
}