Affiliate Disclosure: This post contains Amazon affiliate links. If you purchase through these links, eBlogarithm may earn a commission at no extra cost to you. Prices and availability are subject to change.
Codeforces Round #388 (Div. 2), problem: (B) Parallelogram is Back Solution in C/C++
int main()
{
int x1,y1,x2,y2,x3,y3;
scanf("%d%d\n%d%d\n%d%d",&x1,&y1,&x2,&y2,&x3,&y3);
printf("3\n%d %d\n%d %d\n%d %d",x1+x2-x3,y1+y2-y3,x2+x3-x1,y2+y3-y1,x3+x1-x2,y3+y1-y2);
return 0;
}
📦 Looking for Codeforces Round 388 Div Problem Parallelogram? Check the best deals on Amazon.
🛒 Shop Codeforces Round 388 Div Problem Parallelogram on Amazon
As an Amazon Associate, eBlogarithm earns from qualifying purchases. Prices and availability are subject to change.
Affiliate Disclosure: This post contains Amazon affiliate links. If you purchase through these links, eBlogarithm may earn a commission at no extra cost to you. Prices and availability are subject to change.
Codeforces Round #388 (Div. 2), problem: (B) Parallelogram is Back Solution in C/C++
int main()
{
int x1,y1,x2,y2,x3,y3;
scanf("%d%d\n%d%d\n%d%d",&x1,&y1,&x2,&y2,&x3,&y3);
printf("3\n%d %d\n%d %d\n%d %d",x1+x2-x3,y1+y2-y3,x2+x3-x1,y2+y3-y1,x3+x1-x2,y3+y1-y2);
return 0;
}
📦 Looking for Codeforces Round 388 Div Problem Parallelogram? Check the best deals on Amazon.
🛒 Shop Codeforces Round 388 Div Problem Parallelogram on Amazon
As an Amazon Associate, eBlogarithm earns from qualifying purchases. Prices and availability are subject to change.