Problem 46551. Solve a ballot counting problem
Candidate X and Candidate O receive the same number (n) of votes in an election. Write a function to determine the number of ways the ballots can be counted such that X is never behind O. For example, for n = 3 there are five ways:
XXXOOO
XXOXOO
XXOOXO
XOXXOO
XOXOXO
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers13
Suggested Problems
-
4207 Solvers
-
151 Solvers
-
418 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
810 Solvers
-
Count letters occurence in text, specific to words with a given length.
156 Solvers
More from this Author269
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!