首页 > 其他 > 详细

ural 1058 chocolate

时间:2015-08-01 14:13:56      阅读:166      评论:0      收藏:0      [点我收藏+]
Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Description

Fishburg confectionery factory produces convex polygon-shaped chocolates. Little Boy and Karlsson bought one and wanted to break it into two fragments. The areas of the fragments must be equal. Create a code to find out the length of breakage-line of a minimal length using the given chocolate form.

Input

The first line of input contains an integer N — the number of polygon vertices (4 ≤  N ≤ 50). The other N lines contain coordinates of the vertices in the counter-clockwise order. Coordinates are real numbers from −100 to 100 and given with at most 3 digits after decimal point.

Output

Output should contain the minimal length of breakage-line with accuracy to 0.0001.

Sample Input

inputoutput
4
0 0
4 0
4 3
0 3
3
技术分享
1 #include <stdio.h>
View Code

 

ural 1058 chocolate

原文:http://www.cnblogs.com/cyd308/p/4694029.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!