Help needed in Kickstart problem Vote ??

From some days i was thinking a solution for this problem Vote of Kickstart, Unfortunately i was not able to deduce any thing out of it. Below is the link for the problem :->

Vote Kickstart

If possible, please give proof of correctness of your approach. Also you can suggest me some good problems on combinatorics for practice.

One Google search yielded exactly what you need: Bertrand’s ballot theorem.

Yeah, thanks. Its just n-m/n+m. You can add more problems related to this if you know some :slight_smile: