This page may be out of date. Save your draft before refreshing this page.Submit any pending changes before refreshing this page.

Alice and Bob are playing a game. They start with an *m* by *n* chocolate bar. The players take turns choosing a remaining square of chocolate, and eating it, along with every remaining square below it and to its right.

The game sounds pretty delicious! But, there's a catch. The top left square is poi...

Here's a neat problem from this year's ACM-ICPC NEERC Southern Subregional Contest (reworded by me):

Alice is thinking of a permutation on the*n* numbers [math]1,2,3,\ldots,n[/math]. She wants to tell you some information about the permutation without just telling you the whole thing. So, she picks *m* triples of distinct nu...

(more)Loading…Alice is thinking of a permutation on the

Say we have two [math]n \times n[/math] matrices [math]\mathbf{A},\mathbf{B}[/math] of integers*, and we want to compute the matrix product [math]\mathbf{C}=\mathbf{AB}[/math]. The "obvious" algorithm to do this takes [math]O(n^3)[/math] time: we need to do [math]n[/math] multiplications and add them up to compute each of the [math]n^2[/math] entries of [math]\mathbf{C}[/math].

However, in 1969, Volker Strassen came up with an algorithm that runs faster th...

(more)Loading…However, in 1969, Volker Strassen came up with an algorithm that runs faster th...