func_code_string: #include <bits/stdc++.h>   using namespace std;   const int mod = (int)1e9 + 7;   const int MOD = (int)998244353;   const int INF = (int)1e18;   bool cmp(const pair<long long, long long>& a,            const pair<long long, long long>& b) {     if (a.second == b.second) return a.first < b.first;     return a.second > b.second;   }   void solve() {     long long a, b, x, y, p, q;     cin >> a >> b >> x >> y >> p >> q;     vector<long long> v;     long long cnt = 0;     map<pair<long long, int>, int> m1;     long long n, m;     n = a + x - p;     m = b + y - q;     v.push_back(n);     v.push_back(m);     m1[{n, m}] = 1;     cnt++;     n = a - x + p;     m = b - y + q;     if (m1[{n, m}] == 0) {       cnt++;       m1[{n, m}] = 1;       v.push_back(n);       v.push_back(m);     }     n = -a + x + p;     m = -b + y + q;     if (m1[{n, m}] == 0) {       cnt++;       m1[{n, m}] = 1;       v.push_back(n);       v.push_back(m);     }     cout << cnt <<   n ;     cnt = ((int)(v).size());     for (long long i = 0; i < cnt; i++) {       cout << v[i] <<    ;       if (i & 1) cout <<   n ;     }     return;   }   int main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     long long t = 1, m = 1;     while (t--) {       solve();     }   }   