My sincere condolence to family and friends.

I will probably get lots of minuses, but I need to say it being student of courses about ethics and irrational human behavior.

I don't think it was a good idea of offering prizes with such option attached. It's like a prize money given away, but if you keep it you are of low morale qualities. So you do can take it, but if you take it you are an a@#$ole. I don't have anything against donating prize money (I am thinking about doing pledge about my own prize money if I ever win anything in the future), but I think in this particular situation TopCoder puts winners in "moral hot spot".

Much better option would be something like this (IMHO): - as humblefool was an inspiration to many many Indian coders; - as he was very good at TopCoder competition;

why not something like:

"TopCoder donates $10 to Harsha's wife for every previously registered Indian coder participating in SRM 625".

Editorial — http://www.vexorian.com/2014/06/srm-625-i-semi-wrote-it.html

попробуйте

#include <limits>
#define isnan isololonan
#define isinf isololoinf

Max-flow min-cut

We can use maxflow. Build a graph, whose vertices are elements of a given grid that are reachable from '$' by several steps of length 3, and edges are between vertices separated by two elements. Edges may have capacity 0, 1, 2 or INF (it depends on the number of '.', 'H' and 'b' between two vertices) and vertices may have capacity 0, 1 or INF (means 'H', '.' and 'b').

Addicting game, love the animation :D

maybe i'm addicted :D

I actually played this long ago and it had an influence but I forgot the game's name until you linked it.

Let's fix the position of the first element: we have n choices to do that. z[1][1] = n

Now if we fixed i elements and have j groups for the next element we have three choices:

• New element will merge some two groups: z[i + 1][j — 1] += z[i][j] * j

  coefficient is equals to j because we can choose what two neighboring groups we will merge

• New element will be in a new group: z[i + 1][j + 1] += z[i][j] * j

  because we can choose between what two neighboring groups we insert new group

• New element will extend some group: z[i + 1][j] += z[i][j] * j * ((i + 1 == n) ? 1 : 2)

  coefficient 2 because we can choose from where extend group: left or right

  coefficient j because we can choose what group extend

In the end we should sum z[k][i] for all i from 1 to g with coefficient C[n — k — 1][i — 1] for positions of spaces