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 Solvers13
Suggested Problems
-
322 Solvers
-
294 Solvers
-
Arrange Vector in descending order
13318 Solvers
-
Replace all zeros and NaNs in a matrix with the string 'error'
103 Solvers
-
Create a vector whose elements depend on the previous element
788 Solvers
More from this Author322
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
