Hi, thank you very much for your effort, the problems are quite interesting =D.

In problem H, there are several typos in both, the Codeforces statements and the downloadable ones, due to the superindexes have been converted into normal case. For example, when it says "In the first (top) row there are 2n−1 switches", it should say "In the first (top) row there are 2^(n−1) switches" or "there are 2n computers" (it should say 2^n computers).

You can see and download the correct statement from http://pc.fdi.ucm.es/swerc/swerc09/SWERC-set.pdf