Chocolate Cutting Problem

Suppose you have rectangular chocolate of size n × n n \times n . Each turn, you can choose a piece of chocolate, and break it along a grid line. What is the minimum number of turns that you need in order to get individual chocolate squares?

Note: You are not allowed to break multiple pieces in a turn. You only choose a single piece.

n 2 2 \frac{ n^2} { 2} n 2 1 n^2 - 1 n 1 n - 1 n 2 n^2

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...