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 comments
Loading...
Problem Recent Solvers16
Suggested Problems
-
Back to basics 9 - Indexed References
464 Solvers
-
Rosenbrock's Banana Function and its derivatives
168 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2146 Solvers
-
Replace multiples of 5 with NaN
472 Solvers
-
860 Solvers
More from this Author329
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
