【CF#459 A 】Pashmak and Garden （水题）

题干:

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 x₁, y₁, x₂, y₂ ( - 100 ≤ x₁, y₁, x₂, y₂ ≤ 100) integers, where x₁ and y₁ are coordinates of the first tree and x₂ and y₂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 x₃, y₃, x₄, y₄ that correspond to the coordinates of the two other trees. If there are several solutions you can output any of them.

Note that x₃, y₃, x₄, y₄ must be in the range ( - 1000 ≤ x₃, y₃, x₄, y₄ ≤ 1000).

Examples

Input

0 0 0 1

Output

1 0 1 1

Input

0 0 1 1

Output

0 1 1 0

Input

0 0 1 2

Output

-1

Pashmak has fallen in love with an attractive girl called Parmida since one year ago...

Input

The first line contains four space-separated x₁, y₁, x₂, y₂ ( - 100 ≤ x₁, y₁, x₂, y₂ ≤ 100) integers, where x₁ and y₁ are coordinates of the first tree and x₂ and y₂ are coordinates of the second tree. It's guaranteed that the given points are distinct.

Output

Note that x₃, y₃, x₄, y₄ must be in the range ( - 1000 ≤ x₃, y₃, x₄, y₄ ≤ 1000).

Examples

Input

0 0 0 1

Output

1 0 1 1

Input

0 0 1 1

Output

0 1 1 0

Input

0 0 1 2

Output

-1

解题报告：

ac代码：

#include<bits/stdc++.h>using namespace std;int main()
{int x1,x2,y1,y2;int d;cin>>x1>>y1>>x2>>y2;if(x1==x2) {d=abs(y1-y2);printf("%d %d %d %d\n",x1+d,y1,x2+d,y2);}else if(y1==y2) {d=abs(x1-x2);printf("%d %d %d %d\n",x1,y1+d,x2,y2+d);}else {if(abs(x1-x2) != abs(y1-y2) ) {printf("-1\n");}else printf("%d %d %d %d\n",x1,y2,x2,y1);}return 0 ;
}

总结：

无

【CF#459 A 】Pashmak and Garden （水题）相关推荐

CF Round #426 (Div. 2) The Useless Toy 思维水题
题目链接: http://codeforces.com/contest/834/problem/A 题目描述: 输入起始状态和结束状态和数列长度, 判断旋转方向是顺时针逆时针还是不合理解题思路: 长 ...
【Educational CF Round 86 (Rated for Div. 2) / 1342 A + B】- A. Road To Zero + B. Binary Perio - 水题
目录 A. Road To Zero 题目大意思路代码 B. Binary Period 题目大意思路代码 A. Road To Zero time limit per test :1 sec ...
22.10.25补卡一堆cf水题
被骂了, 写点水题泄泄愤 Problem - A - Codeforces 贪心, 排一下序, 每次选最大的, 选的同时记录一下已经拿了多少个硬币 /* ⣿⣿⣿⣿⣿⣿⡷⣯⢿⣿⣷⣻⢯⣿⡽⣻⢿⣿⣿⣿⣿⣿⣿ ...
【牛客 - 318L】彪神666（水题，半高精度，递推，trick）
题干: 在国外,666代表魔鬼,777代表上帝. 所以牛逼的彪神就非常不喜欢6这个数字. 有一天彪神突发奇想,,他想求一些书与6无关的数. 如果一个数能被6整除,或者它的十进制表示法中某位上的数字为6 ...
Coderforces 字符串水题合集
今天我们聊聊 Coderforces 字符串水题合集. 字符串就是string. 这是string的百度翻译,我们要谈的是画框的.↓ string是C++.java.VB等编程语言中的字符串,字符串是 ...
2014ACM/ICPC亚洲区广州站- HDU-5127~5137，B（暴力+几何）E（签到水题）K（Dijkstra板子）
已经开始挖区域赛的坑了,CF已经不够打了,其实CF打不动了. 一点一点写吧,看看最后能写多少. B-The E-pang Palace(暴力+几何) 题目链接:http://acm.hdu.edu.c ...
水题/poj 1852 Ants
1 /* 2 PROBLEM:poj1852 3 AUTHER:Nicole 4 MEMO:水题 5 */ 6 #include<cstdio> 7 using namespace std ...
HDU2673-shǎ崽（水题）
如果不能够直接秒杀的题,就不算水题.又应证了那句话,有时候,如果在水题上卡住,那么此题对于你来说,也就不算是水题了额~~ 刚睡醒,迷迷糊糊. 题目的意思很简单,求一个最大的,再求一个最小的.几乎是什么 ...
图论刷水题记录（二）（最短路-----SPFA算法）
继第一篇的后续,又来刷水题了,写的是SPFA算法,这个算法的复杂度比较玄学,感觉能不用就不用了,但是他的好处就是可以判断负圈. 3月26日: 1.POJ 1847 Tram 题意:在一个交通网络上有N ...
图论刷水题记录（一）（最短路-----dijkstra算法）
最近实在不知道干些什么,感觉自己除了水题什么都不会做,算了去刷一刷图论的水题吧本来想合起来一起发,想了想太长的话以后看起来也不方便,题目所以今天晚上就先发了dij部分,由上到下由易变难. 1.POJ ...

【CF#459 A 】Pashmak and Garden （水题）

【CF#459 A 】Pashmak and Garden （水题）相关推荐

最新文章

热门文章