749 B. Parallelogram is Back codeforces

#include<bits/stdc++.h>
using namespace std;
struct node
{
    int x;
    int y;
}arr[5],arr1[5],arr2[5];
int main()
{
    for(int i=1;i<=3;i++)
        cin>>arr[i].x>>arr[i].y;
    int sum=0,visit[5];
    memset(visit,0,sizeof(visit));
    int x1,y1,x2,y2;
    for(int i=1;i<=3;i++)
    {
        visit[i]=1;
        int k=0;
        for(int j=1;j<=3;j++)
        {
            if(!visit[j])
            {
                arr1[++k].x=arr[j].x-arr[i].x;
                arr1[k].y=arr[j].y-arr[i].y;
            }

        }
        arr2[++sum].x=arr1[1].x+arr1[2].x+arr[i].x;
        arr2[sum].y=arr1[1].y+arr1[2].y+arr[i].y;
        memset(visit,0,sizeof(visit));
    }
    cout<<sum<<endl;
    for(int i=1;i<=sum;i++)
    {
        cout<<arr2[i].x<<' '<<arr2[i].y<<endl;
    }
    return 0;
}