Battle of the Brains

Battle of the Brains header image 1

Entries from January 2012

Do You Have What It Takes? ACM ICPC Practice Problem Set

January 31st, 2012 · Comments

Preparing for World Finals in Poland? Interested in computer programming?  Try your hand at this practice problem, straight from the 2011 World Finals in Orlando, FL!   You can find this set and more problems on the ACM ICPC website.

Trash Removal - Problem ID: trash

Allied Chute Manufacturers is a company that builds trash chutes. A trash chute is a hollow tube installed in buildings so that trash dropped in at the top will fall down and be collected in the basement. Designing trash chutes is actually highly nontrivial. Depending on what kind of trash people are expected to drop into them, the trash chute needs to have an appropriate size. And since the cost of manufacturing a trash chute is proportional to its size, the company always would like to build a chute that is as small as possible. Choosing the right size can be tough though.

We will consider a 2-dimensional simplification of the chute design problem. A trash chute points straight down and has a constant width. Objects that will be dropped into the trash chute are modeled as polygons. Before an object is dropped into the chute it can be rotated so as to provide an optimal fit. Once dropped, it will travel on a straight path downwards and will not rotate in flight. The following figure shows how an object is first rotated so it fits into the trash chute.

TrashProblemPic.jpg

Your task is to compute the smallest chute width that will allow a given polygon to pass through.

Input

The input contains several test cases. Each test case starts with a line containing an integer n (3 ≤  n ≤  100), the number of points in the polygon that models the trash item. The next n lines then contain pairs of integers xi and yi (0 ≤ xi; yi ≤ 10^4), giving the coordinates of the polygonvertices in order. All points in one test case are guaranteed to be mutually distinct and the polygon sides will never intersect. (Technically, there is one inevitable exception of two neighboring sides sharing their common vertex. Of course, this is not considered an intersection.)

The last test case is followed by a line containing a single zero.

Output

For each test case, display its case number followed by the width of the smallest trash chute through which it can be dropped. Display the minimum width with exactly two digits to the right of the decimal point, rounding up to the nearest multiple of 1/100. Answers within 1/100 of the correct rounded answer will be accepted.

Follow the format of the sample output.

Sample Input                      Output for the Sample Input

3                                                     Case 1: 2.40

0  0                                                Case 2: 14.15

3  0

0  4

4

0  10

10 0

20 10

10 20

0

Tags: World Finals

Behind the Scenes: IBMers Jeremy Lavergne & Jon Wedaman Talk ICPC Regionals

January 17th, 2012 · Comments

For the first podcast of 2012, we're treating you to a behind-the-scenes look at what - and who - makes our regionals competitions so successful.  Podcast host Christine Guerrini catches up with IBM intern Jeremy Lavergne (bottom, left) about how he got involved as an ICPC regional contest system administrator, as well as what he's working on now with IBM Software Group.  She also gets the inside scoop from former Speed Team member and current IBMer Jon Wedaman (bottom, right) on how his time as a volunteer system administrator helped his programming career.

Visit the World Finals website for the latest on this year's competition and to brush up on practice problems.  Have a fun picture of your teammates?  Tweet us @BrainBattleICPC!

JeremyLavergnepic.jpg jonpicture.jpg

00:0000:00

Tags: Regionals