Codeforces Round #388 (Div. 2) 749B Parallelogram is Back
来源:互联网 发布:迪杰斯特拉算法 详解 编辑:程序博客网 时间:2024/05/29 08:58
题目传送门:点击打开链接
Long time ago Alex created an interesting problem about parallelogram. The input data for this problem contained four integer points on the Cartesian plane, that defined the set of vertices of some non-degenerate (positive area) parallelogram. Points not necessary were given in the order of clockwise or counterclockwise traversal.
Alex had very nice test for this problem, but is somehow happened that the last line of the input was lost and now he has only three out of four points of the original parallelogram. He remembers that test was so good that he asks you to restore it given only these three points.
The input consists of three lines, each containing a pair of integer coordinatesxi andyi ( - 1000 ≤ xi, yi ≤ 1000). It's guaranteed that these three points do not lie on the same line and no two of them coincide.
First print integer k — the number of ways to add one new integer point such that the obtained set defines some parallelogram of positive area. There is no requirement for the points to be arranged in any special order (like traversal), they just define the set of vertices.
Then print k lines, each containing a pair of integer — possible coordinates of the fourth point.
0 01 00 1
31 -1-1 11 1
If you need clarification of what parallelogram is, please check Wikipedia page:
https://en.wikipedia.org/wiki/Parallelogram
题意:给你平行四边形的三个点:问你第四个点有几种可能,并输出这些可能的点。(无需按顺序输出)
如果这个平行四边形是ABCD的话。xa-xb=xd-xc ya-yb=yd-yc
根据这个公式就能很简单的退出来了。
#include<bits/stdc++.h>using namespace std;#define LL long long#define M(a) memset(a,0,sizeof(a))struct ssr{ int x,y;} spot[5];int main(){ M(spot); while(~scanf("%d %d",&spot[1].x,&spot[1].y)) { scanf("%d %d",&spot[2].x,&spot[2].y); scanf("%d %d",&spot[3].x,&spot[3].y); int tempx=0,tempy=0; printf("3\n"); tempx=spot[3].x-spot[2].x+spot[1].x; tempy=spot[3].y-spot[2].y+spot[1].y; printf("%d %d\n",tempx,tempy); tempx=spot[3].x-spot[1].x+spot[2].x; tempy=spot[3].y-spot[1].y+spot[2].y; printf("%d %d\n",tempx,tempy); tempx=spot[1].x-spot[3].x+spot[2].x; tempy=spot[1].y-spot[3].y+spot[2].y; printf("%d %d\n",tempx,tempy); } return 0;}
- Codeforces Round #388 (Div. 2) 749B Parallelogram is Back
- Codeforces Round #388 (Div. 2)B Parallelogram is Back
- Codeforces Round #388(Div. 2)B. Parallelogram is Back【计算几何】
- 【codeforces 749B】Parallelogram is Back
- 749 B. Parallelogram is Back codeforces
- Codeforces 749B-Parallelogram is Back
- 【codeforces 749B】 Parallelogram is Back
- codeforces 388 div2 749B - Parallelogram is Back
- B. Parallelogram is Back
- Codeforces 749 B Parallelogram is Back(自定义set去重)
- Codeforces Round #313 (Div. 2) B. Gerald is into Art
- Codeforces Round #313 (Div. 2)-B. Gerald is into Art
- Codeforces Round #352 (Div. 2) B. Different is Good
- Parallelogram is Back
- Parallelogram is Back
- Codeforces Round #388 (Div. 2) (A+B)
- Codeforces Round #388 (Div. 2) A+B+C!
- Codeforces Round #388 (Div. 2) A,B,C,D 题解
- Spring-基于注解的配置[01定义Bean+扫描Bean]
- zookeeper原理(转)
- ubuntu自动挂载硬盘
- 逻辑与 逻辑或 三目运算符 if else 20170721
- SAP簇表BSEG取数优化的方法
- Codeforces Round #388 (Div. 2) 749B Parallelogram is Back
- java 线程介绍
- 20170722:数据库命题
- Python爬虫json和JsonPath系列之十一
- Python——解析命令行参数docopt模块
- 正交向量与正交子空间
- Python中MD5编码
- 聚类算法--K值估计及效果评估
- SGI版的空间配置器