Tuesday, August 16, 2011

The Problem of the Week Day 2: Week of 8/14 - 8/20

Today, we will do start our main problems! We will mainly be generating values to work with today.

Easy Problem: If there is a chess tournament with n people in it, how many games must they play to get a winner?

For example, if there are seven players. One player will get a bye (sit out for the round and automatically move on) while the other six play. There will be three winners plus the bye makes four. Then, they will play two games to get the two finalists who will play for the win. So, in the first round, there were three games, then two, then one, giving you a six game tournament.

Find data for the values from 1 - 6.

n 1 2 3 4 5 6 7
An 6

Hard Problem: If you cut a pizza with n straight cuts, what is the maximum pieces of pizza you can get?

If you were to use one straight cut, you would just be able to split the pizza in half, which would make two pieces of pizza.

Find data from 2 - 5 or 6.

n 1 2 3 4 5 6 7
An 2

Hint: The pieces don't have to be equal in size, and shouldn't be equal.

No comments:

Post a Comment