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
-
2287 Solvers
-
Back to basics 23 - Triangular matrix
1036 Solvers
-
Convert hex color specification to MATLAB RGB
245 Solvers
-
Lychrel Number Test (Inspired by Project Euler Problem 55)
101 Solvers
-
Volume difference between Ellipsoid and Sphere
129 Solvers
More from this Author292
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!