码迷,mamicode.com
首页 > 其他好文 > 详细

ural 1058 chocolate

时间:2015-08-01 14:17:05      阅读:121      评论: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
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!