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
-
Read a column of numbers and interpolate missing data
2317 Solvers
-
6677 Solvers
-
Omit columns averages from a matrix
596 Solvers
-
Sum all integers from 1 to 2^n
16048 Solvers
-
341 Solvers
More from this Author297
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!