Pashmak and Garden
来源:互联网 发布:pg数据库 知乎 编辑:程序博客网 时间:2024/06/08 02:57
Description
Pashmak has fallen in love with an attractive girl called Parmida since one year ago...
Today, Pashmak set up a meeting with his partner in a romantic garden. Unfortunately, Pashmak has forgotten where the garden is. But he remembers that the garden looks like a square with sides parallel to the coordinate axes. He also remembers that there is exactly one tree on each vertex of the square. Now, Pashmak knows the position of only two of the trees. Help him to find the position of two remaining ones.
Input
The first line contains four space-separated x1, y1, x2, y2( - 100 ≤ x1, y1, x2, y2 ≤ 100) integers, where x1 andy1 are coordinates of the first tree andx2 and y2 are coordinates of the second tree. It's guaranteed that the given points are distinct.
Output
If there is no solution to the problem, print -1. Otherwise print four space-separated integers x3, y3, x4, y4 that correspond to the coordinates of the two other trees. If there are several solutions you can output any of them.
Note that x3, y3, x4, y4 must be in the range( - 1000 ≤ x3, y3, x4, y4 ≤ 1000).
Sample Input
0 0 0 1
1 0 1 1
0 0 1 1
0 1 1 0
0 0 1 2
-1
#include<cstdio>#include<iostream>#include<algorithm>using namespace std;int main(){ int x1,y1,x2,y2,x3,y3,x4,y4,t,k,flag; while(cin>>x1>>y1>>x2>>y2){ flag=1; if(x1==x2){ t=abs(y1-y2); x3=x1+t; x4=x2+t; y3=y1; y4=y2; } else if(y1==y2){ t=abs(x1-x2); y3=y1+t; y4=y2+t; x3=x1; x4=x2; } else if(x1!=x2&&y1!=y2){ t=abs(y1-y2); k=abs(x1-x2); if(t==k){ x3=x1; y3=y2; x4=x2; y4=y1; } else{ flag=0; } } if(flag==1){ cout<<x3<<" "<<y3<<" "<<x4<<" "<<y4<<endl; } else{ cout<<"-1"<<endl; } } return 0;}
- A. Pashmak and Garden
- cf459A Pashmak and Garden
- A. Pashmak and Garden
- Pashmak and Garden
- Pashmak and Garden
- 【CODEFORCES】 A. Pashmak and Garden
- Codeforces 459A Pashmak and Garden(水题)
- codeforces-#459A Pashmak and Garden
- codeforces 459A. Pashmak and Garden
- CF 261A. Pashmak and Garden
- CF 261A. Pashmak and Garden
- Codeforces-459A-Pashmak and Garden
- Codeforces Round #261 (Div. 2) A. Pashmak and Garden (水题)
- Codeforces Round #261 (Div. 2) A. Pashmak and Garden
- Codeforces #261 (Div. 2) A. Pashmak and Garden(水题)
- Codeforces Round #261 (Div. 2) A. Pashmak and Garden【水】
- Codeforces Round #261 (Div. 2) A. Pashmak and Garden
- Codeforces Round #261 (Div. 2)A. Pashmak and Garden
- 老友记一路相伴---2015年12月英语月总
- 堆排序的初步学习
- 【PAT】1003. Emergency (25) DFS 最短路径及最短路径数
- CCA Spark and Hadoop 开发者认证技能点【2016只为hadoop达到巅峰】
- mysql基础学习笔记
- Pashmak and Garden
- watchman--no-pretty get-sockname returned with exit code 1 ERROR
- 20160101罗振宇的跨年演讲
- oozie ErrorCode 含义
- 客户端在连接服务器报10061错误的原因
- 2440重新学习
- Ubuntu 安装Nginx
- 深入理解TCP(二)
- 数据总线