CodeforcesRound#261(Div.2)A.PashmakandGarden_html/css_WEB-ITnose
内容导读
互联网集市收集整理的这篇技术教程文章主要介绍了CodeforcesRound#261(Div.2)A.PashmakandGarden_html/css_WEB-ITnose,小编现在分享给大家,供广大互联网技能从业者学习和参考。文章包含2845字,纯文字阅读大概需要5分钟。
内容图文
![CodeforcesRound#261(Div.2)A.PashmakandGarden_html/css_WEB-ITnose](/upload/InfoBanner/zyjiaocheng/399/0bdeceae7a284ee5b988c8ac89c35a51.jpg)
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 and y1 are coordinates of the first tree and x2 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 test(s)
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
#include#include int main(){ int x1,x2,y1,y2,x3,x4,y3,y4,h1,h2; while(scanf("%d%d%d%d",&x1,&y1,&x2,&y2)!=EOF) { h1=x1-x2;h2=y1-y2; h1=fabs(h1); h2=fabs(h2); if(h1!=0&&h2!=0&&h1!=h2) { printf("-1\n"); continue; } if(h1==0) { y3=y1;y4=y2; x3=x1+h2; x4=x2+h2; } if(h2==0) { x3=x1;x4=x2; y3=y1+h1; y4=y2+h1; } if(h1==h2) { x3=x1;x4=x2; if(y1>y2) { y3=y1-h1; y4=y2+h1; } else { y3=y1+h1; y4=y2-h1; } } printf("%d %d %d %d\n",x3,y3,x4,y4); } return 0;}
内容总结
以上是互联网集市为您收集整理的CodeforcesRound#261(Div.2)A.PashmakandGarden_html/css_WEB-ITnose全部内容,希望文章能够帮你解决CodeforcesRound#261(Div.2)A.PashmakandGarden_html/css_WEB-ITnose所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错,欢迎将互联网集市网站推荐给程序员好友。
内容备注
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 gblab@vip.qq.com 举报,一经查实,本站将立刻删除。
内容手机端
扫描二维码推送至手机访问。