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
-
Longest run of consecutive numbers
6748 Solvers
-
Duplicate each element of a vector.
639 Solvers
-
Return a list sorted by number of consecutive occurrences
438 Solvers
-
Volume difference between Ellipsoid and Sphere
137 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
190 Solvers
More from this Author328
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
