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
-
2164 Solvers
-
Get the area codes from a list of phone numbers
1062 Solvers
-
Project Euler: Problem 5, Smallest multiple
1505 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1301 Solvers
-
The Answer to Life, the Universe, and Everything
544 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!