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
-
The Hitchhiker's Guide to MATLAB
3327 Solvers
-
341 Solvers
-
416 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
232 Solvers
-
Calculate the probability that at least two people in a group share the same birthday.
94 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!