当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1940：Polygon Programming with Ease

题目描述
Read the statement of Problem 1939! Given a list of meeting locations as specified in the description of Problem 1939, you have to calculate the locations of the Foreign Offices.
输入解释
See the input specification of Problem 1939 for the format, and the output specification of Problem 1939 for the meaning of the input.
输出解释
See the output specification of Problem 1939 for the format, and the input specification of Problem 1939 for the meaning of the output.
输入样例 
5 14 2 20 4 18 12 12 18 10 10
3 -3 5 -2 5 -3 6
3 -2 10 5 10 -1 12
输出样例 
5 10.000000 2.000000 18.000000 2.000000 22.000000 6.000000 14.000000 18.000000 10.000000 18.000000
3 -4.000000 6.000000 -2.000000 4.000000 -2.000000 6.000000
3 -8.000000 12.000000 4.000000 8.000000 6.000000 12.000000
提示
The relationship between the sample input and output polygons is illustrated in the figure below. Solid lines indicate the polygon joining the Foreign Offices, whereas dashed lines indicate the polygon joining the meeting locations. To generate further sample input you may use your solution to Problem 1939.
该题目是Virtual Judge题目，来自 北京大学POJ
题目来源 Ulm Local 2002
源链接： POJ-1940
最后修改于 2020-10-29T06:18:26+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
1000 30000