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
-
Find relatively common elements in matrix rows
2037 Solvers
-
Sum all integers from 1 to 2^n
14754 Solvers
-
Given a window, how many subsets of a vector sum positive
850 Solvers
-
Moving average (variable kernel length)
123 Solvers
-
4921 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!