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
-
21911 Solvers
-
Return unique values without sorting
934 Solvers
-
Put two time series onto the same time basis
327 Solvers
-
Sum the entries of each column of a matrix which satisfy a logical condition.
163 Solvers
-
Calculate Amount of Cake Frosting
25632 Solvers
More from this Author291
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!